On the least exponential growth admitting uncountably many closed permutation classes
arXiv:math/0307399
Abstract
We show that the least exponential growth of counting functions which admits uncountably many closed permutation classes lies between 2^n and (2.33529...)^n.
13 pages