On the least exponential growth admitting uncountably many closed permutation classes
Abstract
We show that the least exponential growth of counting functions which admits uncountably many closed permutation classes lies between 2n and (2.33529...)n.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.