Abstract
We study permutations that are sorted by operators of the form S ° α ° S, where S is the usual stack sorting operator introduced by Knuth and α is any D 8-symmetry obtained by combining the classical reverse, complement, and inverse operations. Such permutations can be characterized by excluded (generalized) patterns. Some conjectures about the enumeration of these permutations, refined with numerous classical statistics, have been proposed by Claesson, Dukes, and Steingrímsson. We prove these conjectures, and enrich one of them with a few more statistics. The proofs mostly rely on generating trees techniques, and on a recent bijection of Giraudo between Baxter and twisted Baxter permutations.
Article PDF
Similar content being viewed by others
References
Albert, M.H., Atkinson, M.D., Bouvel, M., Claesson, A., Dukes, M.: Private communication. (2010)
Albert M.H. et al.: On the inverse image of pattern classes under bubble sort. J. Combin. 2(2), 231–243 (2011)
Babson, E., Steingrímsson, E.: Generalized permutation patterns and a classification of the Mahonian statistics. Sém. Lothar. Combin. 44, Art. B44b (2000)
Barcucci E. et al.: ECO: a methodology for the enumeration of combinatorial objects. J. Differ. Equations Appl. 5(4-5), 435–490 (1999)
Baxter G.: On fixed points of the composite of commuting functions. Proc. Amer. Math. Soc. 15, 851–855 (1964)
Bernini A., Ferrari L., Pinzani R.: Enumerating permutations avoiding three Babson-Steingrímsson patterns. Ann. Combin. 9(2): 137–162 (2005)
Bóna, M.: A survey of stack-sorting disciplines. Electron. J. Combin. 9(2), #A1 (2002/03)
Bousquet-Mélou, M.: Multi-statistic enumeration of two-stack sortable permutations. Electron. J. Combin. 5, #R21 (1998)
Bousquet-Mélou M.: Sorted and/or sortable permutations. Discrete Math. 225(1-3): 25–50 (2000)
Bousquet-Mélou M., et al.: (2+2)-free posets, ascent sequences and pattern avoiding permutations. J. Combin. Theory Ser. A 117(7): 884–909 (2010)
Brändén, P., Claesson, A.: Mesh patterns and the expansion of permutation statistics as sums of permutation patterns. Electron. J. Combin. 18(2), #P5 (2011)
Chung F.R.K., et al.: The number of Baxter permutations. J. Combin. Theory Ser. A 24(3): 382–394 (1978)
Claesson, A., Dukes, M., Steingrímsson, E.: Private communication. (2007)
Claesson A., Dukes M., Steingrímsson E.: Permutations sortable by n – 4 passes through a stack. Ann. Combin. 14(1): 45–51 (2010)
Claesson, A., Úlfarsson, H.: Sorting and preimages of pattern classes. DMTCS proc. AR, 595–606 (2012)
Dokos T., et al.: Permutation patterns and statistics. Discrete Mathematics. 312(18): 2760–2775 (2012)
Dulucq S., Gire S., Guibert O.: A combinatorial proof of J. West’s conjecture. Discrete Math. 187(1-3): 71–96 (1998)
Dulucq S., Gire S., West J.: Permutations with forbidden subsequences and nonseparable planar maps. Discrete Math. 153(1-3): 85–103 (1996)
Dulucq S., Guibert O.: Baxter permutations. Discrete Math. 180(1-3): 143–156 (1998)
Giraudo, S.: Combinatoire algébrique des arbres, PhD thesis, Université Paris-Est, Cedex, France (2011)
Giraudo S.: Algebraic and combinatorial structures on pairs of twin binary trees. J. Algebra 360, 115–157 (2012)
Goulden I.P.,West J.: Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations. J. Combin. Theory Ser. A 75(2): 220–242 (1996)
Guibert, O.: Combinatoire des permutations à motifs exclus en liaison avec mots, cartes planaires et tableaux de Young. PhD thesis, Université Bordeaux 1, Talence, France (1995)
Knuth, D.E.: The Art of Computer Programming: Fundamental Algorithms, Vol. 1. 3rd edition. Addison-Wesley, Reading, MA (1997)
Ouchterlony, E.: On Young tableau involutions and patterns in permutations. PhD thesis, Linköpings Universitet, Linköping, Sweden (2005)
The OEIS Foundation Inc.: The on-line encyclopedia of integer sequences. http://oeis.org (2007)
Úlfarsson, H.: Describing West-3-stack-sortable permutations with permutation patterns. Sém. Lothar. Combin. 67, Art. B67d (2011/12)
Ú lfarsson H.: A unification of permutation patterns related to Schubert varieties. Pure Math. Appl. 22(2): 273–296 (2011)
Viennot G.: Permutations ayant une forme donnée. Discrete Math. 26(3): 279–284 (1979)
West, J.: Permutations with forbidden subsequences and stack-sortable permutations. PhD thesis, MIT, Cambridge, MA (1990)
West J.: Sorting twice through a stack. Theoret. Comput. Sci. 117(1-2): 303–313 (1993)
West J.: Generating trees and the Catalan and Schröder numbers. Discrete Math. 146(1-3): 247–262 (1995)
West, J.: Enumeration of Reading’s twisted Baxter permutations. In: The Fourth Annual International Conference on Permutation Patterns. Reykjavik University, Reykjavik (2006)
Zeilberger, D.: A proof of Julian West’s conjecture that the number of two-stack-sortable permutations of length \({n {\rm is} 2(3n)!/((n + 1)!(2n + 1)!)}\). Discrete Math. 102(1), 85–93 (1992)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bouvel, M., Guibert, O. Refined Enumeration of Permutations Sorted with Two Stacks and a D 8-Symmetry. Ann. Comb. 18, 199–232 (2014). https://doi.org/10.1007/s00026-014-0219-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00026-014-0219-8