Pattern avoidance by even permutations

Details Pattern avoidance by even permutations Pattern avoidance by even permutations

2011-06-18

arxiv.org/abs/1106.3653v1

Mathematics

Combinatorics

14 pages, 8 figures, 4 tables. Originally presented at Permutation Patterns 2010

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Pattern avoidance by even permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pattern avoidance by even permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pattern avoidance by even permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-465748