Permutations Containing Many Patterns
M. H. Albert, Micah Coleman, Ryan Flynn, Imre Leader
math.COarXiv:math/0609771
Abstract
It is shown that the maximum number of patterns that can occur in a permutation of length n is asymptotically 2n. This significantly improves a previous result of Coleman.
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