Counting 3-stack-sortable permutations
From MaRDI portal
Publication:2299650
DOI10.1016/j.jcta.2020.105209zbMath1433.05005arXiv1903.09138OpenAlexW3001233149WikidataQ126315343 ScholiaQ126315343MaRDI QIDQ2299650
Publication date: 21 February 2020
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.09138
polynomial-time algorithmdescentpermutation patternpeak\(\gamma\)-nonnegativitystack-sortingvalid hook configurationreal-rooted
Related Items (27)
Pop-stack-sorting for Coxeter groups ⋮ Stack-sorting for Coxeter groups ⋮ Sorting Cayley permutations with pattern-avoiding machines ⋮ Catalan intervals and uniquely sorted permutations ⋮ Highly sorted permutations and Bell numbers ⋮ Lattice paths and \((n - 2)\)-stack sortable permutations ⋮ Fertilitopes ⋮ Polyurethane toggles ⋮ Stack-sortable permutations and beyond ⋮ Highly sorted permutations with respect to a 312-avoiding stack ⋮ Uniquely sorted permutations ⋮ Quantifying noninvertibility in discrete dynamical systems ⋮ Fertility monotonicity and average complexity of the stack-sorting map ⋮ Asymptotic normality in t-stack sortable permutations ⋮ Enumeration of Stack-Sorting Preimages via a Decomposition Lemma ⋮ Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations ⋮ Unnamed Item ⋮ Fertility, Strong Fertility, and Postorder Wilf Equivalence ⋮ Troupes, cumulants, and stack-sorting ⋮ Asymptotics of 3-stack-sortable permutations ⋮ Stack-sorting with consecutive-pattern-avoiding stacks ⋮ Stack sorting with increasing and decreasing stacks ⋮ Meeting covered elements in \(\nu\)-Tamari lattices ⋮ Stack words and a bound for 3-stack sortable permutations ⋮ Stack-sorting, set partitions, and Lassalle's sequence ⋮ Stack-sorting for Words ⋮ Troupes, cumulants, and stack-sorting
Uses Software
Cites Work
- Unnamed Item
- Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry
- Permutations sortable by \(n - 4\) passes through a stack
- 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
- Postscript: ``Permutations with forbidden subsequences and a generalized Schröder number [Discrete Mathematics 218 (2000) 121--130]
- A survey of stack-sorting disciplines
- A combinatorial proof of J. West's conjecture
- Sorted and/or sortable permutations
- Symmetry and unimodality in \(t\)-stack sortable permutations
- Staircases, dominoes, and the growth rate of 1324-avoiders
- A simplicial complex of 2-stack sortable permutations
- Comparing algorithms for sorting with \(t\) stacks in series
- Permutations with forbidden subsequences and nonseparable planar maps
- Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
- Permutations with forbidden subsequences and a generalized Schröder number
- Further bijections to pattern-avoiding valid hook configurations
- Catalan intervals and uniquely sorted permutations
- Descents in \(t\)-sorted permutations
- Fertility numbers
- Polyurethane toggles
- Stack-sorting preimages of permutation classes
- Two first-order logics of permutations
- 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
- Combinatorics of Permutations
- Unimodality, log-concavity, real-rootedness and beyond
- Fighting fish
- Postorder Preimages
- Stack-sorting for Words
- What is an Answer?
- Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
- Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations
- Fertility, Strong Fertility, and Postorder Wilf Equivalence
- Sorting and preimages of pattern classes
- On linear transformations preserving the Pólya frequency property
This page was built for publication: Counting 3-stack-sortable permutations
