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