Rook numbers and the normal ordering problem

Details Rook numbers and the normal ordering problem Rook numbers and the normal ordering problem

2004-02-23

arxiv.org/abs/math/0402376v2

Mathematics

Combinatorics

14 pages, presented as poster in FPSAC'04

Scientific paper

For an element $w$ in the Weyl algebra generated by $D$ and $U$ with relation $DU=UD+1$, the normally ordered form is $w=\sum c_{i,j}U^iD^j$. We demonstrate that the normal order coefficients $c_{i,j}$ of a word $w$ 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 $c_{i,j}$. We calculate the Weyl binomial coefficients: normal order coefficients of the element $(D+U)^n$ in the Weyl algebra. We extend all these results to the $q$-analogue of the Weyl algebra. We discuss further generalizations using $i$-rook numbers.

Affiliated with

Also associated with

No associations

Rating

Rook numbers and the normal ordering problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Rook numbers and the normal ordering problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rook numbers and the normal ordering problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-352530