All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 3

Displaying 41 – 58 of 58

Showing per page

Discrete excursions.

Bousquet-Mélou, Mireille (2006)

Séminaire Lotharingien de Combinatoire [electronic only]

Discrete limit laws for additive functions on the symmetric group

Eugenijus Manstavičius (2005)

Acta Mathematica Universitatis Ostraviensis

Inspired by probabilistic number theory, we establish necessary and sufficient conditions under which the numbers of cycles with lengths in arbitrary sets posses an asymptotic limit law. The approach can be extended to deal with the counts of components with the size constraints for other random combinatorial structures.

Divided differences and symmetric functions

Wenchang Chu (1999)

Bollettino dell'Unione Matematica Italiana

L'operatore di differenze multivariate è utilizzato per stabilire varie formule di somme riguardanti le funzioni simmetriche, le quali hanno uno stretto legame con le identità del «termine costante».

Divisors, partitions and some new q-series identities

Alexander E. Patkowski (2009)

Colloquium Mathematicae

We obtain new q-series identities that have interesting interpretations in terms of divisors and partitions. We present a proof of a theorem of Z. B. Wang, R. Fokkink, and W. Fokkink, which follows as a corollary to our main q-series identity, and offer a similar result.

Domination in functigraphs

Linda Eroh, Ralucca Gera, Cong X. Kang, Craig E. Larson, Eunjeong Yi (2012)

Discussiones Mathematicae Graph Theory

Let G₁ and G₂ be disjoint copies of a graph G, and let f:V(G₁) → V(G₂) be a function. Then a functigraph C(G,f) = (V,E) has the vertex set V = V(G₁) ∪ V(G₂) and the edge set E = E(G₁) ∪ E(G₂) ∪ {uv | u ∈ V(G₁), v ∈ V(G₂),v = f(u)}. A functigraph is a generalization of a permutation graph (also known as a generalized prism) in the sense of Chartrand and Harary. In this paper, we study domination in functigraphs. Let γ(G) denote the domination number of G. It is readily seen that γ(G) ≤ γ(C(G,f))...

Duality triads of higher rank: Further properties and some examples

Matthias Schork (2006)

Open Mathematics

It is shown that duality triads of higher rank are closely related to orthogonal matrix polynomials on the real line. Furthermore, some examples of duality triads of higher rank are discussed. In particular, it is shown that the generalized Stirling numbers of rank r give rise to a duality triad of rank r.

Duplicate inverse series relations and hypergeometric evaluations with z = 1 / 4

Wenchang Chu (2002)

Bollettino dell'Unione Matematica Italiana

The Gould-Hsu (1973) inverse series relations have been systematically applied to the research of hypergeometric identities. Their duplicate version is established and used to demonstrate several terminating F 2 3 ⁢ 1 / 4 -summation formulas. Further hypergeometric evaluations with the same variable are obtained through recurrence relations.

Durfee polynomials.

Canfield, E.Rodney, Corteel, Sylvie, Savage, Carla D. (1998)

The Electronic Journal of Combinatorics [electronic only]

Currently displaying 41 – 58 of 58

Previous Page 3