Number of Permutations with Given Descent Set and Cycle Structure
Séminaire lotharingien de combinatoire, Tome 21 (1989)
Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website
The purpose of this paper is to count permutations in Sn with a given cycle structure and a given descent set. Our main result asserts that the number of these permutations can be expressed as a scalar product of two symmetric functions, one associated with the cycle structure and the other with the descent set. Both of these symmetric functions can be interpreted as characteristics of certain representations of the symmetric group.
The paper has been finally published as a joint paper with Ira Gessel under the title "Counting permutations with given cycle structure and descent set" in J. Combin. Theory Ser. A 64 (1993), 189-215.
@article{SLC_1989_21_a7,
author = {Christophe Reutenauer},
title = {Number of {Permutations} with {Given} {Descent} {Set} and {Cycle} {Structure}},
journal = {S\'eminaire lotharingien de combinatoire},
publisher = {mathdoc},
volume = {21},
year = {1989},
url = {http://geodesic.mathdoc.fr/item/SLC_1989_21_a7/}
}
Christophe Reutenauer. Number of Permutations with Given Descent Set and Cycle Structure. Séminaire lotharingien de combinatoire, Tome 21 (1989). http://geodesic.mathdoc.fr/item/SLC_1989_21_a7/