Alternating, pattern-avoiding permutations

Details Alternating, pattern-avoiding permutations Alternating, pattern-avoiding permutations

2008-05-14

arxiv.org/abs/0805.1964v1

Electronic J. Combinatorics, 16:N7, 2009.

Mathematics

Combinatorics

7 pages

Scientific paper

We study the problem of counting alternating permutations avoiding collections of permutation patterns including 132. We construct a bijection between the set S_n(132) of 132-avoiding permutations and the set A_{2n + 1}(132) of alternating, 132-avoiding permutations. For every set p_1, ..., p_k of patterns and certain related patterns q_1, ..., q_k, our bijection restricts to a bijection between S_n(132, p_1, ..., p_k), the set of permutations avoiding 132 and the p_i, and A_{2n + 1}(132, q_1, ..., q_k), the set of alternating permutations avoiding 132 and the q_i. This reduces the enumeration of the latter set to that of the former.

Affiliated with

Also associated with

No associations

Rating

Alternating, pattern-avoiding 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 Alternating, pattern-avoiding permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Alternating, pattern-avoiding permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-55293