Rook numbers and the normal ordering problem
From MaRDI portal
Publication:2575808
DOI10.1016/J.JCTA.2005.07.012zbMATH Open1079.05002arXivmath/0402376OpenAlexW1994510890MaRDI QIDQ2575808FDOQ2575808
Publication date: 6 December 2005
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Abstract: For an element in the Weyl algebra generated by and with relation , the normally ordered form is . We demonstrate that the normal order coefficients of a word are rook numbers on a Ferrers board. We use this interpretation to give a new proof of the rook factorization theorem, which we use to provide an explicit formula for the coefficients . We calculate the Weyl binomial coefficients: normal order coefficients of the element in the Weyl algebra. We extend all these results to the -analogue of the Weyl algebra. We discuss further generalizations using -rook numbers.
Full work available at URL: https://arxiv.org/abs/math/0402376
Recommendations
Factorials, binomial coefficients, combinatorial functions (05A10) (q)-calculus and related topics (05A30) Rings of differential operators (associative algebraic aspects) (16S32) Differential algebra (12H05)
Cites Work
- Title not available (Why is that?)
- Quantum calculus
- Combinatorial aspects of continued fractions
- Title not available (Why is that?)
- Rook Theory. I.: Rook Equivalence of Ferrers Boards
- Ordering of some boson operator functions
- Normal ordering formulae for some boson operators
- The general boson normal ordering problem
- Title not available (Why is that?)
- Q-counting rook configurations and a formula of Frobenius
- On the combinatorics of normal ordering bosonic operators and deformations of it
- Generalized rook polynomials
- Normal ordering and generalised Stirling numbers
Cited In (31)
- The excedance algebra
- Normally ordered forms of powers of differential operators and their combinatorics
- The Matrix Ansatz, orthogonal polynomials, and permutations
- Rook placements in Young diagrams and permutation enumeration
- A curious \(q\)-analogue of Hermite polynomials
- A \(q\)-enumeration of alternating permutations
- Cyclic and Linear Graph Partitions and Normal Ordering
- Blow-up algebras, determinantal ideals, and Dedekind-Mertens-like formulas
- Eulerian polynomials via the Weyl algebra action
- Bijections on \(m\)-level rook placements
- Combinatorially interpreting generalized Stirling numbers
- Path decompositions of digraphs and their applications to Weyl algebra
- From sequences to polynomials and back, via operator orderings
- Walks, partitions, and normal ordering
- Weight-dependent commutation relations and combinatorial identities
- Signed differential posets and sign-imbalance
- Recent developments in combinatorial aspects of normal ordering
- Monomial and toric ideals associated to Ferrers graphs
- On the Stirling numbers associated with the meromorphic Weyl algebra
- Representing elements of the Weyl algebra by labeled trees
- The commutation relation \(xy=qyx+hf(y)\) and Newton's binomial formula
- Normal ordering associated with \(\lambda\)-Stirling numbers in \(\lambda\)-shift algebra
- Title not available (Why is that?)
- Orthogonal polynomials and operator orderings
- Elliptic rook and file numbers
- Normal ordering problem and the extensions of the Stirling grammar
- Normal ordering \(q\)-bosons and combinatorics
- Noncrossing normal ordering for functions of boson operators
- File placements, fractional matchings, and normal ordering
- Hiking a generalized Dyck path: a tractable way of calculating multimode boson evolution operators
- On \(xD\)-generalizations of Stirling numbers and Lah numbers via graphs and rooks
This page was built for publication: Rook numbers and the normal ordering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575808)