Permutations Containing Many Patterns

M. H. Albert, Micah Coleman, Ryan Flynn +1

It is shown that the maximum number of patterns that can occur in a permutation of length $n$ is asymptotically $2^n$. This significantly improves a previous result of Coleman.