Pattern avoidance and Young tableaux (Q510311): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Descent sets on 321-avoiding involutions and hook decompositions of partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration formulas for Young tableaux in a diagonal strip / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bijections for pattern-avoiding permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another look at bijections for pattern-avoiding permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inversion formulae on permutations avoiding 321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(1324\)-avoiding permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bijections for refined restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating, pattern-avoiding permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern avoidance for alternating permutations and Young tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3283895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2732561 / rank
 
Normal rank

Latest revision as of 11:25, 13 July 2024

scientific article
Language Label Description Also known as
English
Pattern avoidance and Young tableaux
scientific article

    Statements

    Pattern avoidance and Young tableaux (English)
    0 references
    0 references
    0 references
    17 February 2017
    0 references
    Summary: This paper extends Lewis's bijection [\textit{J. B. Lewis}, J. Comb. Theory, Ser. A 118, No. 4, 1436--1450 (2011; Zbl 1231.05286)] to a bijection between a more general class \(\mathcal{L}(n,k,I)\) of permutations and the set of standard Young tableaux of shape \(\langle (k+1)^n\rangle\), so the cardinality \[ |\mathcal{L}(n,k,I)|=f^{(k+1)^{n}\rangle}, \] is independent of the choice of \(I\subseteq [n]\). As a consequence, we obtain some new combinatorial realizations and identities on Catalan numbers. In the end, we raise a problem on finding a bijection between \(\mathcal{L}(n,k,I)\) and \(\mathcal{L}(n,k,I')\) for distinct \(I\) and \(I'\).
    0 references
    0 references
    pattern avoidance
    0 references
    Young tableaux
    0 references
    Catalan numbers
    0 references