Enumeration of permutations sorted with two passes through a stack and D_8 symmetries
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...
Main Authors: | Mathilde Bouvel, Olivier Guibert |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2012-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/3080/pdf |
Similar Items
-
Operators of equivalent sorting power and related Wilf-equivalences
by: Michael Albert, et al.
Published: (2013-01-01) -
A relation on 132-avoiding permutation patterns
by: Natalie Aisbett
Published: (2015-12-01) -
On an open problem of Green and Losonczy: exact enumeration of freely braided permutations
by: Toufik Mansour
Published: (2004-01-01) -
Sorting and preimages of pattern classes
by: Anders Claesson, et al.
Published: (2012-01-01) -
Involutions on Baxter Objects
by: Kevin Dilks
Published: (2012-01-01)