Zvezdelina Stankova-Frenkel, Julian West
Published 2001-03-24, updated 2001-06-11Version 2
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.
Comments: 20 pages, 14 figures, corrected typo
3-regular colored graphs and classification of surfaces
On the classification of $\mathbb{Z}_4$-codes
A classification of plane and planar 2-trees
![QR code for arXiv:math/0103152 [math.CO]](http://oss.arxitics.com/images/favicon.svg)