Corpus ID: 8631251

On powers of Stirling matrices

@article{Mezo2008OnPO,
  title={On powers of Stirling matrices},
  author={Istv'an Mezo},
  journal={arXiv: Combinatorics},
  year={2008}
}
  • I. Mezo
  • Published 21 December 2008
  • Mathematics
  • arXiv: Combinatorics
The powers of matrices with Stirling number-coefficients are investigated. It is revealed that the elements of these matrices have a number of properties of the ordinary Stirling numbers. Moreover, "higher order" Bell, Fubini and Eulerian numbers can be defined. Hence we give a new interpretation for E. T. Bell's iterated exponential integers. In addition, it is worth to note that these numbers appear in combinatorial physics, in the problem of the normal ordering of quantum field theoretical… Expand

References

SHOWING 1-10 OF 21 REFERENCES
Concrete Mathema tics
  • Addison-Wesley
  • 1994
A
  • I. Sol omon, Hierarchical Dobiński-type relations via substitution and the moment problem, J.Phys. A: Math.Gen. 37 3475-3487
  • 2004
Hierarchical Dobiński-type relations via substitution and the moment problem
We consider the transformation properties of integer sequences arising from the normal ordering of exponentiated boson ([a, a†] = 1) monomials of the form exp[λ(a†)ra], r = 1, 2, ..., under theExpand
Combinatorial Theory, reprint of the 1979 edi tion
  • 1997
Combinatorial Theory, reprint of the 1979 edition
  • Combinatorial Theory, reprint of the 1979 edition
  • 1997
Some canonical sequences of integers
TLDR
Many interesting new sequences arise, such as 1, 1, 2, 26, 152, 1144, ..., which shifts one place left when transformed by the Stirling numbers of the second kind, and whose exponential generating function satisfies A'(x) = A(ex − 1) + 1. Expand
Some canonical sequences of integers, Linear Alg. Applications
  • Some canonical sequences of integers, Linear Alg. Applications
  • 1995
Concrete Mathematics
  • Concrete Mathematics
  • 1994
Generatingfunctionology
  • Academic Press
  • 1994
Riordan arrays and combinatorial sums
TLDR
The concept of a Riordan array is used in a constructive way to find the generating function of many combinatorial sums, which can help to obtain the closed form of the sum or its asymptotic value. Expand
...
1
2
3
...