On the least exponential growth admitting uncountably many closed permutation classes

DOI10.1016/j.tcs.2004.03.056zbMath1125.68392arXivmath/0307399OpenAlexW2021415664MaRDI QIDQ1885903

Martin Klazar

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

zbMATH Keywords

Exponential growthPermutation avoidanceWqo

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)

Related Items (2)

Growth rates of permutation classes: categorization up to the uncountability threshold ⋮ Intervals of permutation class growth rates

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the least exponential growth admitting uncountably many closed permutation classes