Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry
From MaRDI portal
Publication:404464
DOI10.1007/s00026-014-0219-8zbMath1295.05009arXiv1210.5967OpenAlexW2092556779MaRDI QIDQ404464
Mathilde Bouvel, Olivier Guibert
Publication date: 4 September 2014
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.5967
permutationsenumerationpermutation statisticsgenerating treesstack sortingBaxter permutationsgeneralized patternssymmetries of the square
Related Items (14)
A generating tree approach to \(k\)-nonnesting partitions and permutations ⋮ Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence ⋮ Polyurethane toggles ⋮ Revstack sort, zigzag patterns, descent polynomials of \(t\)-revstack sortable permutations, and Steingrímsson's sorting conjecture ⋮ Vincular pattern avoidance on cyclic permutations ⋮ Stack-sorting preimages of permutation classes ⋮ Pattern-avoiding inversion sequences and open partition diagrams ⋮ Enumeration of Stack-Sorting Preimages via a Decomposition Lemma ⋮ Semi-Baxter and strong-Baxter permutations ⋮ Fertility, Strong Fertility, and Postorder Wilf Equivalence ⋮ Tableau sequences, open diagrams, and Baxter families ⋮ Unnamed Item ⋮ Counting 3-stack-sortable permutations ⋮ Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences
Uses Software
Cites Work
- Unnamed Item
- On the inverse image of pattern classes under bubble sort
- Permutation patterns and statistics
- Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
- Permutations sortable by \(n - 4\) passes through a stack
- Sorting twice through a stack
- Describing West-3-stack-sortable permutations with permutation patterns
- Permutations ayant une forme donnée
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!)
- The number of Baxter permutations
- Multi-static enumeration of two-stack sortable permutations
- A survey of stack-sorting disciplines
- Generalized permutation patterns and a classification of the Mahonian statistics
- A combinatorial proof of J. West's conjecture
- Sorted and/or sortable permutations
- Algebraic and combinatorial structures on pairs of twin binary trees
- Generating trees and the Catalan and Schröder numbers
- Permutations with forbidden subsequences and nonseparable planar maps
- Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
- Enumerating permutations avoiding three Babson-Steingrímsson patterns
- A unification of permutation patterns related to Schubert varieties
- ECO:a methodology for the enumeration of combinatorial objects
- On Fixed Points of the Composite of Commuting Functions
- Sorting and preimages of pattern classes
- The On-Line Encyclopedia of Integer Sequences
- Baxter permutations
This page was built for publication: Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry
