Enumération de permutations à motifs exclus
Séminaire lotharingien de combinatoire, Tome 30 (1993)
Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website
We give a combinatorial proof that two-stack sortable permutations are equinumerous with rooted nonseparable planar maps, by making use of the concept of generating trees. To be precise, we construct generating trees for both objects under consideration and show that they are isomorphic. A detailed study of the correspondence allows us to conclude refined enumeration results where we are also able to keep track of several parameters defined for these permutations, respectively these maps.
@article{SLC_1993_30_a6,
author = {Serge Dulucq and Sophie Gire and Olivier Guibert and Julian West},
title = {Enum\'eration de permutations \`a motifs exclus},
journal = {S\'eminaire lotharingien de combinatoire},
publisher = {mathdoc},
volume = {30},
year = {1993},
url = {http://geodesic.mathdoc.fr/item/SLC_1993_30_a6/}
}
Serge Dulucq; Sophie Gire; Olivier Guibert; Julian West. Enumération de permutations à motifs exclus. Séminaire lotharingien de combinatoire, Tome 30 (1993). http://geodesic.mathdoc.fr/item/SLC_1993_30_a6/