arXiv Analytics

Sign in

arXiv:1109.3641 [math.CO]AbstractReferencesReviewsResources

Pattern avoidance in ascent sequences

Paul Duncan, Einar Steingrimsson

Published 2011-09-16, updated 2011-10-30Version 2

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.

Comments: Substantially reorganized, bijection in Thm. 2.15 (previously 2.14) defined formally and proof rewritten. 18 pages
Categories: math.CO
Subjects: 05A05, 05A15, 05A18, 05A19
Related articles: Most relevant | Search more
arXiv:2202.02089 [math.CO] (Published 2022-02-04)
Mahonian and Euler-Mahonian statistics for set partitions
arXiv:1906.00680 [math.CO] (Published 2019-06-03)
Sum of weighted records in set partitions
arXiv:0710.1816 [math.CO] (Published 2007-10-09)
Crossings and Nestings of Two Edges in Set Partitions