Permutations Containing Many Patterns
classification
🧮 math.CO
keywords
patternsasymptoticallycolemancontainingimproveslengthmanymaximum
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.