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 2n. This significantly improves a previous result of Coleman.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.