Permutations Containing Many Patterns

Abstract

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.

Cited by in corpus (1)

• Patterns in Permutations and Involutions: A Structural and Enumerative Approach