Alternating Permutations with Restrictions and Standard Young Tableaux

نویسندگان

  • Yuexiao Xu
  • Sherry H. F. Yan
چکیده

Abstract. In this paper, we establish bijections between the set of 4123-avoiding In this paper, we establish bijections between the set of 4123-avoiding down-up alternating permutations of length 2n and the set of standard Young tableaux of shape (n, n, n), and between the set of 4123-avoiding down-up alternating permutations of length 2n−1 and the set of shifted standard Young tableaux of shape (n+1, n, n−1) via an intermediate structure of Yamanouchi words. Moreover, we show that 4123-avoiding up-down alternating permutations of length 2n+1 are in one-to-one correspondence with standard Young tableaux of shape (n+ 1, n, n− 1), and 4123-avoiding up-down alternating permutations of length 2n are in bijection with shifted standard Young tableaux of shape (n + 2, n, n− 2).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ascent-Descent Young Diagrams and Pattern Avoidance in Alternating Permutations

We investigate pattern avoidance in alternating permutations and an alternating analogue of Young diagrams. In particular, using an extension of Babson and West’s notion of shape-Wilf equivalence described in our recent paper (with N. Gowravaram), we generalize results of Backelin, West, and Xin and Ouchterlony to alternating permutations. Unlike Ouchterlony and Bóna’s bijections, our bijection...

متن کامل

Pattern avoidance and RSK-like algorithms for alternating permutations and Young tableaux

We define a class Ln,k of permutations that generalizes alternating (up-down) permutations. We then give bijective proofs of certain pattern-avoidance results for this class. The bijections employed include are a modified form of the RSK insertion algorithm and a different bijection with RSK-like properties. As a special case of our results, we give two bijections between the set A2n(1234) of a...

متن کامل

Generating Trees and Pattern Avoidance in Alternating Permutations

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 A2n(2143) of alternating permutations of length 2n avoiding 2143 and the set of standard Young tableaux of shape 〈n, n, n〉, and between the set A2n+1(2143) of alternating permutations of length...

متن کامل

Pattern avoidance in alternating permutations and tableaux ( extended abstract )

We give bijective proofs of pattern-avoidance results for a class of permutations generalizing alternating permutations. The bijections employed include a modified form of the RSK insertion algorithm and recursive bijections based on generating trees. As special cases, we show that the sets A2n(1234) and A2n(2143) are in bijection with standard Young tableaux of shape 〈3〉. Alternating permutati...

متن کامل

Beyond Alternating Permutations: Pattern Avoidance in Young Diagrams and Tableaux

We investigate pattern avoidance in alternating permutations and generalizations thereof. First, we study pattern avoidance in an alternating analogue of Young diagrams. In particular, we extend Babson-West’s notion of shape-Wilf equivalence to apply to alternating permutations and so generalize results of Backelin-West-Xin and Ouchterlony to alternating permutations. Second, we study pattern a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2012