English

Permutations Containing Many Patterns

Combinatorics 2012-02-14 v1

Abstract

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

Keywords

Cite

@article{arxiv.math/0609771,
  title  = {Permutations Containing Many Patterns},
  author = {M. H. Albert and Micah Coleman and Ryan Flynn and Imre Leader},
  journal= {arXiv preprint arXiv:math/0609771},
  year   = {2012}
}