Ascent sequences and 3-nonnesting set partitions (Q2441950): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: (2+2)-free posets, ascent sequences and pattern avoiding permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 021-avoiding ascent sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossings and nestings of matchings and partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ascent sequences and upper triangular matrices containing non-negative integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern avoidance in ascent sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spin-preserving Knuth correspondences for ribbon tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some enumerative results related to ascent sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4443440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS / rank
 
Normal rank

Revision as of 12:25, 7 July 2024

scientific article
Language Label Description Also known as
English
Ascent sequences and 3-nonnesting set partitions
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references