Mathilde Bouvel ; Olivier Guibert
-
Enumeration of permutations sorted with two passes through a stack and D_8 symmetries
dmtcs:3080 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2012,
DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
-
https://doi.org/10.46298/dmtcs.3080
Enumeration of permutations sorted with two passes through a stack and D_8 symmetries
Authors: Mathilde Bouvel 1; Olivier Guibert 1
NULL##NULL
Mathilde Bouvel;Olivier Guibert
1 Laboratoire Bordelais de Recherche en Informatique
We examine the sets of permutations that are sorted by two passes through a stack with a $D_8$ operation performed in between. From a characterization of these in terms of generalized excluded patterns, we prove two conjectures on their enumeration, that can be refined with the distribution of some statistics. The results are obtained by generating trees.