The Electronic Journal of Combinatorics · 2011 · 46 citations · 32 references
Natural SciencesMathematicsAlgebraCombinatoricsNumber TheoryCombinatorial Number TheoryGenerating FunctionsRecurrence RelationsBell NumbersExponential Generating FunctionsRecursionRook TheoryStirling Numbers
A new family of generalized Stirling and Bell numbers is introduced by considering powers $(VU)^n$ of the noncommuting variables $U,V$ satisfying $UV=VU+hV^s$. The case $s=0$ (and $h=1$) corresponds to the conventional Stirling numbers of second kind and Bell numbers. For these generalized Stirling numbers, the recursion relation is given and explicit expressions are derived. Furthermore, they are shown to be connection coefficients and a combinatorial interpretation in terms of statistics is given. It is also shown that these Stirling numbers can be interpreted as $s$-rook numbers introduced by Goldman and Haglund. For the associated generalized Bell numbers, the recursion relation as well as a closed form for the exponential generating function is derived. Furthermore, an analogue of Dobinski's formula is given for these Bell numbers.
32
Concrete Mathematics: A Foundation for Computer Science
Ronald Graham, Donald E. Knuth, Oren Patashnik et al. · Computers in Physics · 1989 · 2.5K citations
Choice Reviews Online · 2009 · 521 citations
John R. Riordan, Louis Comtet · Mathematics of Computation · 1976 · 319 citations
Choice Reviews Online · 2003 · 228 citations