Pattern avoidance in ascent sequences (Q665745): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Importer (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1109.3641 / rank
 
Normal rank

Latest revision as of 15:54, 18 April 2024

scientific article
Language Label Description Also known as
English
Pattern avoidance in ascent sequences
scientific article

    Statements

    Pattern avoidance in ascent sequences (English)
    0 references
    0 references
    0 references
    6 March 2012
    0 references
    Summary: Ascent sequences are sequences of nonnegative integers with restrictions on the size of each letter, depending on the number of ascents preceding it in the sequence. Ascent sequences have recently been related to (2 + 2)-free posets and various other combinatorial structures. We study pattern avoidance in ascent sequences, giving several results for patterns of lengths up to 4, for Wilf equivalence and for growth rates. We establish bijective connections between pattern avoiding ascent sequences and various other combinatorial objects, in particular with set partitions. We also make a number of conjectures related to all of these aspects.
    0 references
    pattern avoidance in ascent sequences
    0 references

    Identifiers

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