On the least exponential growth admitting uncountably many closed permutation classes
Klazar, Martin
Original · EN
We show that the least exponential growth of counting functions which admits uncountably many closed permutation classes lies between 2ⁿ and (2.33529...)ⁿ.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.