Rook numbers and the normal ordering problem (Q2575808)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Rook numbers and the normal ordering problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rook numbers and the normal ordering problem |
scientific article |
Statements
Rook numbers and the normal ordering problem (English)
0 references
6 December 2005
0 references
Using a result concerning normally ordered words given by \textit{A. M. Navon} [Nuovo Cimento 16, 324--330 (1973)], the author provides a new proof of the rook factorization theorem proved by \textit{J. R. Goldman}, \textit{J. T. Joichi} and \textit{D. E. White} [Proc. Am. Math. Soc. 52, 485--492 (1975; Zbl 0312.05002)].
0 references
Rook factorization theorem
0 references
Differential operators
0 references
Binomial coefficients
0 references
Continued fractions
0 references
0.7393843531608582
0 references
0.7204598784446716
0 references
0.7060433626174927
0 references
0.7054252028465271
0 references
