Generating trees and pattern avoidance in alternating permutations

Details Generating trees and pattern avoidance in alternating permutations Generating trees and pattern avoidance in alternating permutations

2010-05-21

arxiv.org/abs/1005.4046v1

Electronic Journal of Combinatorics 19, P21 (2012)

Mathematics

Combinatorics

21 pages. To be presented at FPSAC 2010. Comments welcomed

Scientific paper

We extend earlier work of the same author to enumerate alternating permutations avoiding the permutation pattern 2143. We use a generating tree approach to construct a recursive bijection between the set A_{2n}(2143) of alternating permutations of length 2n avoiding 2143 and standard Young tableaux of shape (n, n, n) and between the set A_{2n + 1}(2143) of alternating permutations of length 2n + 1 avoiding 2143 and shifted standard Young tableaux of shape (n + 2, n + 1, n). We also give a number of conjectures and open questions on pattern avoidance in alternating permutations and generalizations thereof.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-340392