A New Class of Wilf-Equivalent Permutations
classification
🧮 math.CO
keywords
patternspermutationclassclassificationwilf-equivalentcasescompletedcompletes
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.