Fertility monotonicity and average complexity of the stack-sorting map
From MaRDI portal
Publication:2225458
DOI10.1016/j.ejc.2020.103276zbMath1478.05004arXiv2003.05935OpenAlexW3112239781MaRDI QIDQ2225458
Publication date: 8 February 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.05935
Related Items (12)
Pop-stack-sorting for Coxeter groups ⋮ Stack-sorting for Coxeter groups ⋮ Coxeter pop-tsack torsing ⋮ Highly sorted permutations and Bell numbers ⋮ Fertilitopes ⋮ Stack-sortable permutations and beyond ⋮ A lift of West's stack-sorting map to partition diagrams ⋮ Preimages under the Queuesort algorithm ⋮ Restricted stacks as functions ⋮ Enumeration of Stack-Sorting Preimages via a Decomposition Lemma ⋮ Preimages under the bubblesort operator ⋮ Troupes, cumulants, and stack-sorting
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Revstack sort, zigzag patterns, descent polynomials of \(t\)-revstack sortable permutations, and Steingrímsson's sorting conjecture
- Patterns in permutations and words.
- Permutations sortable by \(n - 4\) passes through a stack
- Stack-sorting, set partitions, and Lassalle's sequence
- 2N noncollinear points determine at least 2N directions
- 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)\)!)
- Generating functions for generating trees
- A survey of stack-sorting disciplines
- Catalan intervals and uniquely sorted permutations
- Counting 3-stack-sortable permutations
- Preimages under the stack-sorting algorithm
- Combinatorics of Permutations
- Lattice Path Enumeration
- Postorder Preimages
- Two-stack-sorting with pop stacks
- Ordered Cycle Lengths in a Random Permutation
- Enumerating permutations sortable by \(k\) passes through a pop-stack
This page was built for publication: Fertility monotonicity and average complexity of the stack-sorting map
