Rook numbers and the normal ordering problem (Q2575808): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994510890 / rank
 
Normal rank

Revision as of 23:22, 19 March 2024

scientific article
Language Label Description Also known as
English
Rook numbers and the normal ordering problem
scientific article

    Statements

    Rook numbers and the normal ordering problem (English)
    0 references
    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 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references