Growth rates of permutation classes: categorization up to the uncountability threshold
From MaRDI portal
Publication:2182018
DOI10.1007/s11856-020-1964-5zbMath1439.05009arXiv1605.04289OpenAlexW3000602215WikidataQ126334778 ScholiaQ126334778MaRDI QIDQ2182018
Jay Pantone, Vincent R. Vatter
Publication date: 20 May 2020
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.04289
Related Items (2)
A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs ⋮ Two examples of Wilf-collapse
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Intervals of permutation class growth rates
- Finding regular insertion encodings for permutation classes
- On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
- On growth rates of closed permutation classes
- On the least exponential growth admitting uncountably many closed permutation classes
- Inflations of geometric grid classes of permutations
- Permutation reconstruction from minors
- Permutation reconstruction
- The insertion encoding of permutations
- Permutation classes
- Overview of some general results in combinatorial enumeration
- Small permutation classes
- Representations for real numbers and their ergodic properties
- Linear Automaton Transformations
- PERMUTATION CLASSES OF EVERY GROWTH RATE ABOVE 2.48188
- Growing at a Perfect Speed
- Growth rates of permutation classes: from countable to uncountable
This page was built for publication: Growth rates of permutation classes: categorization up to the uncountability threshold