Any permutation of ordered n-element set [n]=:{1,..., n} may be regarded as introducing a
(possibly null) measure of disorder to that set. For example, the natural order of [7] is …

Commutation Relations, Normal Ordering, and Stirling Numbers Page 1 Commutation
Relations, Normal Ordering, and Stirling Numbers Toufik Mansour • Matthias Schork Mansour • …

Combinatorics and Number Theory of Counting Sequences is an introduction to the theory
of finite set partitions and to the enumeration of cycle decompositions of permutations. The …

Abstract The generalized Stirling numbers Ss; h (n, k) introduced recently by the authors are
shown to be a special case of the three parameter family of generalized Stirling numbers S …

Recurrence Relations for Strongly q-Log-Convex Polynomials Page 1 Canad. Math. Bull. Vol.
54 (2), 2011 pp. 217–229 doi:10.4153/CMB-2011-008-5 c©Canadian Mathematical Society …

Extensions of set partitions and permutations Page 1 Extensions of set partitions and
permutations Jhon B. Caicedo Departamento de Matemáticas, Universidad Sergio Arboleda …

Abstract An n-step Pearson-Gamma random walk in ℝ d starts at the origin and consists of n
independent steps with gamma distributed lengths and uniform orientations. The gamma …

Abstract Given R⊆ N let {nk} R,[nk] R, and L (n, k) R count the number of ways of partitioning
the set [n]:={1, 2,…, n} into k non-empty subsets, cycles and lists, respectively, with each …

Set partitions and permutations with restrictions on the size of the blocks and cycles are
important combinatorial sequences. Counting these objects lead to the sequences …

Let the Bessel number of the second kind B (n, k) be the number of set partitions of [n] into k
blocks of size one or two, and let the Bessel number of the first kind b (n, k) be the coefficient …