Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux

zbMATH Open1300.05319arXiv1301.6796MaRDI QIDQ396936FDOQ396936

Authors: Nihal Gowravaram, Ravi Jagadeesan 

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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 avoidance in the more general context of permutations with restricted ascents and descents. We consider a question of Lewis regarding permutations that are the reading words of thickened staircase Young tableaux, that is, permutations that have (k - 1) ascents followed by a descent, followed by (k - 1) ascents, et cetera. We determine the relative sizes of the sets of pattern-avoiding (k - 1)-ascent permutations in terms of the forbidden pattern. Furthermore, we give inequalities in the sizes of sets of pattern-avoiding permutations in this context that arise from further extensions of shape-equivalence type enumerations.

Full work available at URL: https://arxiv.org/abs/1301.6796

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Ascent-descent Young diagrams and pattern avoidance in alternating permutations
• Pattern avoidance for alternating permutations and Young tableaux
• Pattern avoidance in alternating permutations and tableaux (extended abstract)
• Alternating permutations with restrictions and standard Young tableaux
• Generating trees and pattern avoidance in alternating permutations

zbMATH Keywords

pattern avoidancealternating permutationsWilf equivalencedescent type permutationsshape-Wilf equivalence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10) Combinatorial identities, bijective combinatorics (05A19)

Cites Work

• Restricted permutations
• Combinatorics of permutations
• Criterion for smoothness of Schubert varieties in Sl(n)/B
• Restricted 132-alternating permutations and Chebyshev polynomials
• Generating trees and the Catalan and Schröder numbers
• Title not available (Why is that?)
• Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations
• Coincidental pattern avoidance
• A new class of Wilf-equivalent permutations
• Wilf-equivalence for singleton classes
• Pattern avoidance for alternating permutations and Young tableaux
• 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
• The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent

Cited In (16)

• 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 avoidance in partial permutations
• Alternating permutations with restrictions and standard Young tableaux
• Equidistribution of set-valued statistics on standard Young tableaux and transversals
• Finding the permutations corresponding to a given Young tableau
• Pattern-avoidance in binary fillings of grid shapes (short version)
• Schur-concavity for avoidance of increasing subsequences in block-ascending permutations
• Pattern avoidance in alternating permutations and tableaux (extended abstract)
• Pattern avoidance for alternating permutations and Young tableaux
• On geometry of Young diagrams for Arnold permutations
• Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays
• Pattern avoiding alternating involutions
• Arc permutations
• On a refinement of Wilf-equivalence for permutations

This page was built for publication: Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396936)