Abstract: 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.
Recommendations
Cited in
(36)- Some enumerative results related to ascent sequences
- Ascent sequences and upper triangular matrices containing non-negative integers
- On \(\underline{12} 0\)-avoiding inversion and ascent sequences
- Patterns of relation triples in inversion and ascent sequences
- Vincular patterns in inversion sequences
- Length-four pattern avoidance in inversion sequences
- Generalized ballot sequences are ascent sequences
- Weak ascent sequences and related combinatorial structures
- Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
- Restricted inversion sequences and enhanced 3-noncrossing partitions
- Ascent sequences avoiding pairs of patterns
- Restricted growth function patterns and statistics
- Avoiding-sequences with minimum sum
- Ascent sequences and the binomial convolution of Catalan numbers
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
- An operator on ascent sequences
- Restricted ascent sequences and Catalan numbers
- Inversion sequences avoiding 021 and another pattern of length four
- Modified ascent sequences and Bell numbers
- Difference ascent sequences
- Inversion sequences avoiding pairs of patterns
- Catalan words avoiding pairs of length three patterns
- Pattern avoidance in weak ascent sequences
- Ascent sequences and 3-nonnesting set partitions
- Refining the bijections among ascent sequences, \((2+2)\)-free posets, integer matrices and pattern-avoiding permutations
- Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
- An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
- On 021-avoiding ascent sequences
- Ascent sequences avoiding a triple of 3-letter patterns and Fibonacci numbers
- Catalan pairs and Fishburn triples
- Ascent sequences and Fibonacci numbers
- Dynamical aspects of \(\sigma\)-machines
- On enumeration of pattern-avoiding Fishburn permutations
- Pattern-avoiding ascent sequences of length 3
- Transport of patterns by Burge transpose
- The most and the least avoided consecutive patterns
This page was built for publication: Pattern avoidance in ascent sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q665745)
