arXiv Analytics

Sign in

arXiv:1209.2404 [math.CO]AbstractReferencesReviewsResources

On the Best Upper Bound for Permutations Avoiding A Pattern of a Given Length

Miklos Bona

Published 2012-09-11Version 1

Numerical evidence suggests that certain permutation patterns of length k are easier to avoid than any other patterns of that same length. We prove that these patterns are avoided by no more than (2.25k^2)^n permutations of length n. In light of this, we conjecture that no pattern of length k is avoided by more than that many permutations of length n.

Comments: 12 pages
Categories: math.CO
Subjects: 05A15, 05A16
Related articles: Most relevant | Search more
arXiv:1110.1219 [math.CO] (Published 2011-10-06, updated 2012-03-10)
Describing West-3-stack-sortable permutations with permutation patterns
arXiv:1306.3193 [math.CO] (Published 2013-06-13, updated 2022-09-02)
Permutations avoiding 4321 and 3241 have an algebraic generating function
arXiv:1108.0989 [math.CO] (Published 2011-08-04)
The enumeration of permutations avoiding 2143 and 4231

Links

Toolbox