Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations
From MaRDI portal
Publication:5074770
zbMath1487.05014arXiv1908.04025MaRDI QIDQ5074770
Publication date: 10 May 2022
Full work available at URL: https://arxiv.org/abs/1908.04025
Related Items (11)
Stack-sorting for Coxeter groups ⋮ Catalan intervals and uniquely sorted permutations ⋮ Highly sorted permutations and Bell numbers ⋮ Unimodality of a refinement of Lassalle's sequence ⋮ Fertilitopes ⋮ Fertility, Strong Fertility, and Postorder Wilf Equivalence ⋮ Further bijections to pattern-avoiding valid hook configurations ⋮ Stack-sorting with consecutive-pattern-avoiding stacks ⋮ Counting 3-stack-sortable permutations ⋮ Stack-sorting, set partitions, and Lassalle's sequence ⋮ Troupes, cumulants, and stack-sorting
Cites Work
- Patterns in permutations and words.
- Two integer sequences related to Catalan numbers
- 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
- Sorted and/or sortable permutations
- Symmetry and unimodality in \(t\)-stack sortable permutations
- Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
- Catalan intervals and uniquely sorted permutations
- Descents in \(t\)-sorted permutations
- Fertility numbers
- Counting 3-stack-sortable permutations
- Preimages under the stack-sorting algorithm
- Lattice Path Enumeration
- Fertility, Strong Fertility, and Postorder Wilf Equivalence
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations
