On the least exponential growth admitting uncountably many closed permutation classes
From MaRDI portal
Publication:1885903
DOI10.1016/j.tcs.2004.03.056zbMath1125.68392arXivmath/0307399MaRDI QIDQ1885903
Publication date: 12 November 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0307399
68P10: Searching and sorting
68R05: Combinatorics in computer science
05A05: Permutations, words, matrices
05A16: Asymptotic enumeration
Related Items
Intervals of permutation class growth rates, Growth rates of permutation classes: categorization up to the uncountability threshold
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pattern matching for permutations
- Partially well-ordered closed sets of permutations
- Ascending sequences in permutations
- Regular closed sets of permutations.
- Sorting with two ordered stacks in series.
- Sorting with a forklift
- On growth rates of closed permutation classes
- Generating trees and forbidden subsequences
- An infinite antichain of permutations
- Well-quasi-orderings and sets of finite sequences
- Generalized Stack Permutations
- Sorting Using Networks of Queues and Stacks
- Ordering by Divisibility in Abstract Algebras
- Restricted permutations