English

A New Class of Wilf-Equivalent Permutations

Combinatorics 2007-05-23 v2

Abstract

For about 10 years, the classification of permutation patterns was thought completed up to length 6. In this paper, we establish a new class of Wilf-equivalent permutation patterns, namely, (n-1,n-2,n,tau)~(n-2,n,n-1,tau) for any tau in S_{n-3}. In particular, at level n=6, this result includes the only missing equivalence (546213)~(465213), and for n=7 it completes the classification of permutation patterns by settling all remaining cases in S_7.

Keywords

Cite

@article{arxiv.math/0103152,
  title  = {A New Class of Wilf-Equivalent Permutations},
  author = {Zvezdelina Stankova-Frenkel and Julian West},
  journal= {arXiv preprint arXiv:math/0103152},
  year   = {2007}
}

Comments

20 pages, 14 figures, corrected typo