Generating trees and pattern avoidance in alternating permutations
From MaRDI portal
Abstract: 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.
Recommendations
- On pattern avoiding alternating permutations
- Pattern avoidance in alternating permutations and tableaux (extended abstract)
- Pattern avoidance for alternating permutations and Young tableaux
- Alternating, pattern-avoiding permutations
- Alternating permutations with restrictions and standard Young tableaux
Cited in
(25)- Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux
- On pattern avoiding alternating permutations
- Ascent-descent Young diagrams and pattern avoidance in alternating permutations
- Alternating permutations with restrictions and standard Young tableaux
- A generating tree for permutations avoiding the pattern \(122^+3\)
- On refinements of Wilf-equivalence for involutions
- Alternating, pattern-avoiding permutations
- Equidistribution of set-valued statistics on standard Young tableaux and transversals
- Three-dimensional Catalan numbers and product-coproduct prographs
- Generating trees and forbidden subsequences
- A bijection between weighted Dyck paths and 1234-avoiding alternating permutations
- Pattern avoidance in alternating permutations and tableaux (extended abstract)
- On a family of conjectures of Joel Lewis on alternating permutations
- Increasing trees and alternating permutations
- Combinatorics of exterior peaks on pattern-avoiding symmetric transversals
- Generating trees and proper Riordan arrays
- \((q, t)\)-Catalan numbers: gamma expansions, pattern avoidances, and the \((-1)\)-phenomenon
- Five classes of pattern avoiding inversion sequences under one roof: generating trees
- Wave linked partitions and 312-avoiding permutations with primacy being 1
- Pattern avoidance in alternating sign matrices
- A generating tree with a single label for permutations avoiding the vincular pattern 1−32−4
- Pattern avoiding alternating involutions
- Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels
- On a refinement of Wilf-equivalence for permutations
- Enumeration of standard Young tableaux of shifted strips with constant width
This page was built for publication: Generating trees and pattern avoidance in alternating permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q426780)
