A New Class of Wilf-Equivalent Permutations
| dc.creator | Stankova-Frenkel, Zvezdelina | |
| dc.creator | West, Julian | |
| dc.date | 2001-03-24 | |
| dc.date | 2001-06-11 | |
| dc.date.accessioned | 2026-07-07T04:40:44Z | |
| dc.date.available | 2026-07-07T04:40:44Z | |
| dc.description | 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. | |
| dc.description | 20 pages, 14 figures, corrected typo | |
| dc.identifier | https://arxiv.org/abs/math/0103152 | |
| dc.identifier | http://arxiv.org/abs/math/0103152 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/61129 | |
| dc.subject | Combinatorics | |
| dc.title | A New Class of Wilf-Equivalent Permutations | |
| dc.type | text |