Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
From MaRDI portal
Publication:5074765
zbMath1487.05021arXiv1904.02829MaRDI QIDQ5074765
Publication date: 10 May 2022
Full work available at URL: https://arxiv.org/abs/1904.02829
Related Items
Stack-sortable permutations and beyond, A lift of West's stack-sorting map to partition diagrams, Burstein’s permutation conjecture, Hong and Li’s inversion sequence conjecture and restricted Eulerian distributions, Fertility, Strong Fertility, and Postorder Wilf Equivalence, Counting 3-stack-sortable permutations, Preimages under the bubblesort operator
Uses Software
Cites Work
- Unnamed Item
- Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry
- On the inverse image of pattern classes under bubble sort
- Describing West-3-stack-sortable permutations with permutation patterns
- Stack words and a bound for 3-stack sortable permutations
- Stack-sorting, set partitions, and Lassalle's sequence
- 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)\)!)
- 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
- Linear recurrences with constant coefficients: The multivariate case
- Symmetry and unimodality in \(t\)-stack sortable permutations
- The kernel method: a collection of examples
- A simplicial complex of 2-stack sortable permutations
- Permutations with forbidden subsequences and nonseparable planar maps
- Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
- Catalan intervals and uniquely sorted permutations
- Stack-sorting preimages of permutation classes
- Fertility monotonicity and average complexity of the stack-sorting map
- Counting 3-stack-sortable permutations
- Passing through a stack \(k\) times with reversals
- The kernel method for lattice paths below a line of rational slope
- Two examples of unbalanced Wilf-equivalence
- Preimages under the stack-sorting algorithm
- Actions on permutations and unimodality of descent polynomials
- Polynomial equations with one catalytic variable, algebraic series and map enumeration
- Fighting fish and two-stack sortable permutations
- Two Vignettes On Full Rook Placements
- Egge triples and unbalanced Wilf-equivalence
- A stack and a pop stack in series
- Combinatorics of Permutations
- Postorder Preimages
- Generalized permutation patterns -- a short survey
- Fertility, Strong Fertility, and Postorder Wilf Equivalence
- Sorting and preimages of pattern classes
- On linear transformations preserving the Pólya frequency property
