Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux
From MaRDI portal
Publication:396936
zbMath1300.05319arXiv1301.6796MaRDI QIDQ396936
Ravi Jagadeesan, Nihal Gowravaram
Publication date: 14 August 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.6796
pattern avoidancealternating permutationsWilf equivalencedescent type permutationsshape-Wilf equivalence
Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10)
Related Items (5)
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 ⋮ Pattern avoiding alternating involutions ⋮ On a refinement of Wilf-equivalence for permutations
Cites Work
- Coincidental pattern avoidance
- On Wilf equivalence for alternating permutations
- Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux
- Ascent-descent Young diagrams and pattern avoidance in alternating permutations
- Generating trees and pattern avoidance in alternating permutations
- Alternating permutations with restrictions and standard Young tableaux
- Criterion for smoothness of Schubert varieties in Sl(n)/B
- Restricted 132-alternating permutations and Chebyshev polynomials
- A new class of Wilf-equivalent permutations
- Generating trees and the Catalan and Schröder numbers
- Pattern avoidance for alternating permutations and Young tableaux
- Wilf-equivalence for singleton classes
- Combinatorics of Permutations
- Restricted permutations
- The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent
- Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations
- Unnamed Item
This page was built for publication: Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux
