On xD-Generalizations of Stirling Numbers and Lah Numbers via Graphs and Rooks

preprint2017arXivOpen access

Abstract

This paper studies the generalizations of the Stirling numbers of both kinds and the Lah numbers in association with the normal order problem in the Weyl algebra W=⟨x,D∣Dx−xD=1⟩W=\langle x,D|Dx-xD=1\rangle. Any word ω∈Wω\in W with mm xx's and nn DD's can be expressed in the normally ordered form ω=xm−n∑k≥0{ωk}xkDkω=x^{m-n}\sum_{k\ge 0} {ω\brace {k}} x^{k}D^{k}, where {ωk}{ω\brace {k}} is known as the Stirling number of the second kind for the word ωω. This study considers the expansions of restricted words ωω in WW over the sequences {(xD)k}k≥0\{(xD)^{k}\}_{k\ge 0} and {xDkxk−1}k≥0\{xD^{k}x^{k-1}\}_{k\ge 0}. Interestingly, the coefficients in individual expansions turn out to be generalizations of the Stirling numbers of the first kind and the Lah numbers. The coefficients will be determined through enumerations of some combinatorial structures linked to the words ωω, involving decreasing forest decompositions of quasi-threshold graphs and non-attacking rook placements on Ferrers boards. Extended to qq-analogues, weighted refinements of the combinatorial interpretations are also investigated for words in the qq-deformed Weyl algebra.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.