TY - JOUR

T1 - Boson operator ordering identities from generalized Stirling and Eulerian numbers

AU - Maier, Robert S.

N1 - Publisher Copyright:
© 2024 Elsevier Inc.

PY - 2024/5

Y1 - 2024/5

N2 - Ordering identities in the Weyl–Heisenberg algebra generated by single-mode boson operators are investigated. A boson string composed of creation and annihilation operators can be expanded as a linear combination of other such strings, the simplest example being a normal ordering. The case when each string contains only one annihilation operator is already combinatorially nontrivial. Two kinds of expansion are derived: (i) that of a power of a string Ω in lower powers of another string Ω′, and (ii) that of a power of Ω in twisted versions of the same power of Ω′. The expansion coefficients are shown to be, respectively, generalized Stirling numbers of Hsu and Shiue, and certain generalized Eulerian numbers. Many examples are given. These combinatorial numbers are binomial transforms of each other, and their theory is developed, emphasizing schemes for computing them: summation formulas, Graham–Knuth–Patashnik (GKP) triangular recurrences, terminating hypergeometric series, and closed-form expressions. The results on the first type of expansion subsume a number of previous results on the normal ordering of boson strings.

AB - Ordering identities in the Weyl–Heisenberg algebra generated by single-mode boson operators are investigated. A boson string composed of creation and annihilation operators can be expanded as a linear combination of other such strings, the simplest example being a normal ordering. The case when each string contains only one annihilation operator is already combinatorially nontrivial. Two kinds of expansion are derived: (i) that of a power of a string Ω in lower powers of another string Ω′, and (ii) that of a power of Ω in twisted versions of the same power of Ω′. The expansion coefficients are shown to be, respectively, generalized Stirling numbers of Hsu and Shiue, and certain generalized Eulerian numbers. Many examples are given. These combinatorial numbers are binomial transforms of each other, and their theory is developed, emphasizing schemes for computing them: summation formulas, Graham–Knuth–Patashnik (GKP) triangular recurrences, terminating hypergeometric series, and closed-form expressions. The results on the first type of expansion subsume a number of previous results on the normal ordering of boson strings.

UR - http://www.scopus.com/inward/record.url?scp=85184999435&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85184999435&partnerID=8YFLogxK

U2 - 10.1016/j.aam.2024.102678

DO - 10.1016/j.aam.2024.102678

M3 - Article

AN - SCOPUS:85184999435

SN - 0196-8858

VL - 156

JO - Advances in Applied Mathematics

JF - Advances in Applied Mathematics

M1 - 102678

ER -