Enumerating \(r\)c-invariant permutations with no long decreasing subsequences (Q659582): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4222737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Motzkin numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted symmetric permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice walks in \({\mathbf Z}^ d\) and permutations with no long ascending subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric functions and P-recursiveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Schensted's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutations, matrices, and generalized Young tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Robinson-Schensted and Schützenberger algorithms, an elementary approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric permutations avoiding two patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Representations of the Symmetric Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Increasing and Decreasing Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted permutations / rank
 
Normal rank

Latest revision as of 21:19, 4 July 2024

scientific article
Language Label Description Also known as
English
Enumerating \(r\)c-invariant permutations with no long decreasing subsequences
scientific article

    Statements

    Enumerating \(r\)c-invariant permutations with no long decreasing subsequences (English)
    0 references
    24 January 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    domino tableaux
    0 references
    pattern-avoiding permutation
    0 references
    restricted permutation
    0 references
    reversecomplement map
    0 references
    Robinson-Schensted-Knuth correspondence
    0 references
    tableaux
    0 references
    0 references
    0 references