The ABC's of Classical Enumeration
Séminaire lotharingien de combinatoire, Tome 14 (1986)
Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website
Using the "arbre binaire croissant" permutation decomposition, a relatively simple recurrence relationship is derived that provides refinements, generalizations, and several q-analogs of the Eulerian polynomials, the Euler numbers, the Catalan numbers, the Stirling polynomials of both the first and second kinds, the Hermite polynomials, the Bell polynomials, and others. In several cases, the generating functions for the q-analogs may be expressed in the form of infinite products. The following version is available:
The paper has been finally published under the same title in Ann. Sci. Math. Québec 10 (1986), 207-235.
@article{SLC_1986_14_a1,
author = {Don Rawlings},
title = {The {ABC's} of {Classical} {Enumeration}},
journal = {S\'eminaire lotharingien de combinatoire},
publisher = {mathdoc},
volume = {14},
year = {1986},
url = {http://geodesic.mathdoc.fr/item/SLC_1986_14_a1/}
}
Don Rawlings. The ABC's of Classical Enumeration. Séminaire lotharingien de combinatoire, Tome 14 (1986). http://geodesic.mathdoc.fr/item/SLC_1986_14_a1/