On the least exponential growth admitting uncountably many closed permutation classes
Martin Klazar
math.COarXiv:math/0307399
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.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell