On 12 0-avoiding inversion and ascent sequences
From MaRDI portal
Publication:2225465
Abstract: Recently, Yan and the first named author investigated systematically the enumeration of inversion or ascent sequences avoiding vincular patterns of length , where two of the three letters are required to be adjacent. They established many connections with familiar combinatorial families and proposed several interesting conjectures. The objective of this paper is to address two of their conjectures concerning the enumeration of -avoiding inversion or ascent sequences.
Recommendations
Cites work
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- A new decomposition of ascent sequences and Euler-Stirling statistics
- A permutation code preserving a double Eulerian bistatistic
- A sextuple equidistribution arising in pattern avoidance
- Alternating-sign matrices and domino tilings. I
- Ascent sequences and 3-nonnesting set partitions
- Ascent sequences avoiding pairs of patterns
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
- Consecutive patterns in inversion sequences
- Consecutive patterns in inversion sequences. II: Avoiding patterns of relations
- Enumerating \((2 + 2)\)-free posets by indistinguishable elements
- Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
- Enumeration of inversion sequences avoiding triples of relations
- Generalized pattern avoidance
- Generalized permutation patterns and a classification of the Mahonian statistics
- On 021-avoiding ascent sequences
- Pattern avoidance in ascent sequences
- Pattern avoidance in inversion sequences
- Patterns in inversion sequences. I.
- Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
- Patterns in permutations and words.
- Patterns of relation triples in inversion and ascent sequences
- Restricted inversion sequences and enhanced 3-noncrossing partitions
- Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence
- Some Wilf-equivalences for vincular patterns
- The mathematics of lecture hall partitions
- Vincular patterns in inversion sequences
- Wilf equivalences between vincular patterns in inversion sequences
Cited in
(16)- Combinatorics of the symmetries of ascents in restricted inversion sequences
- Patterns of relation triples in inversion and ascent sequences
- Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
- Further enumeration results concerning a recent equivalence of restricted inversion sequences
- Generating Trees for 0021-Avoiding Inversion Sequences and a Conjecture of Hong and Li
- Restricted inversion sequences and Schröder paths
- On 0012-avoiding inversion sequences and a conjecture of Lin and Ma
- Inversion sequences avoiding a triple of patterns of 3 letters
- An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
- Burstein’s permutation conjecture, Hong and Li’s inversion sequence conjecture and restricted Eulerian distributions
- Difference ascent sequences
- Inversion sequences avoiding 021 and another pattern of length four
- Generating trees growing on the left for pattern-avoiding inversion sequences
- Difference ascent sequences and related combinatorial structures
- Revised ascent sequences avoiding a pattern of length 4
- Inversion sequences avoiding 012 (001) and another pattern of length four
This page was built for publication: On \(\underline{12} 0\)-avoiding inversion and ascent sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225465)
