论文信息 - Combinatorial Interpretation of Generalized Stirling Numbers

Combinatorial Interpretation of Generalized Stirling Numbers

A combinatorial interpretation of the earlier studied generalized Stirling numbers, emerging in a normal ordering problem and its inversion, is given. It involves unordered forests of certain types of labeled trees. Partition number arrays related to such forests are also presented.

Wolfdieter Lang | W. Lang

[1] UK,et al. The general boson normal ordering problem , 2003 .

[2] Donald E. Knuth. Convolution polynomials , 1992 .

[3] R. Stanley. What Is Enumerative Combinatorics , 1986 .

[4] D. Alexander. A History of Complex Dynamics: From Schröder to Fatou and Julia , 1994 .

[5] A. I. Solomon,et al. The Boson Normal Ordering Problem and Generalized Bell Numbers , 2002 .

[6] N. Biggs,et al. Graph Theory 1736-1936 , 1976 .

[7] R. Guy,et al. The Book of Numbers , 2019, The Crimean Karaim Bible.

[8] Irene A. Stegun,et al. Handbook of Mathematical Functions. , 1966 .

[9] Charalambos A. Charalambides,et al. Enumerative combinatorics , 2018, SIGA.

[10] Matthias Schork,et al. On the combinatorics of normal ordering bosonic operators and deformations of it , 2003 .

[11] N. J. A. Sloane,et al. The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[12] France,et al. Combinatorial approach to generalized Bell and Stirling numbers and boson normal ordering problem , 2005 .

[13] Wolfdieter Lang,et al. On Generalizations of the Stirling Number Triangles , 2000 .

[14] Kraków,et al. Some useful combinatorial formulas for bosonic operators , 2004, quant-ph/0405103.

[15] Philippe Flajolet,et al. Varieties of Increasing Trees , 1992, CAAP.

[16] Leonard Carlitz,et al. On Arrays of Numbers , 1932 .