arXiv Analytics

Sign in

arXiv:1106.3653 [math.CO]AbstractReferencesReviewsResources

Pattern avoidance by even permutations

Andrew M. Baxter, Aaron D. Jaggard

Published 2011-06-18Version 1

We study questions of even-Wilf-equivalence, the analogue of Wilf-equivalence when attention is restricted to pattern avoidance by permutations in the alternating group. Although some Wilf-equivalence results break when considering even-Wilf-equivalence analogues, we prove that other Wilf-equivalence results continue to hold in the even-Wilf-equivalence setting. In particular, we prove that t(t-1)...321 and (t-1)(t-2)...21t are even-shape-Wilf-equivalent for odd t, paralleling a result (which held for all t) of Backelin, West, and Xin for shape-Wilf-equivalence. This allows us to classify the patterns of length 4, and to partially classify patterns of length 5 and 6. As with transition to involution-Wilf-equivalence, some (but not all) of the classical Wilf-equivalence results are preserved when we make the transition to even-Wilf-equivalence.

Comments: 14 pages, 8 figures, 4 tables. Originally presented at Permutation Patterns 2010
Categories: math.CO
Subjects: 05A05
Related articles: Most relevant | Search more
arXiv:1208.5718 [math.CO] (Published 2012-08-28, updated 2015-01-02)
Pattern Avoidance in Poset Permutations
arXiv:1509.07941 [math.CO] (Published 2015-09-26)
Pattern Avoidance for Random Permutations
arXiv:1804.06265 [math.CO] (Published 2018-04-17)
Pattern Avoidance of Generalized Permutations