Pattern avoidance in ascent sequences

Details Pattern avoidance in ascent sequences Pattern avoidance in ascent sequences

2011-09-16

arxiv.org/abs/1109.3641v2

Mathematics

Combinatorics

Substantially reorganized, bijection in Thm. 2.15 (previously 2.14) defined formally and proof rewritten. 18 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Pattern avoidance in ascent sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pattern avoidance in ascent sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pattern avoidance in ascent sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-535216