Patterns of relation triples in inversion and ascent sequences
From MaRDI portal
Publication:2283035
Recommendations
- Enumeration of inversion sequences avoiding triples of relations
- A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples
- On \(\underline{12} 0\)-avoiding inversion and ascent sequences
- Vincular patterns in inversion sequences
- Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
Cites work
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- A new decomposition of ascent sequences and Euler-Stirling statistics
- A sextuple equidistribution arising in pattern avoidance
- Ascent sequences and 3-nonnesting set partitions
- Ascent sequences and the binomial convolution of Catalan numbers
- Ascent sequences avoiding pairs of patterns
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
- Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
- Enumeration of inversion sequences avoiding triples of relations
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- 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.
- Permutation classes
- Restricted inversion sequences and enhanced 3-noncrossing partitions
- Restricted permutations and queue jumping
- Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence
- Some enumerative results related to ascent sequences
- The mathematics of lecture hall partitions
Cited in
(24)- Enumeration of inversion sequences avoiding triples of relations
- Combinatorics of the symmetries of ascents in restricted inversion sequences
- Statistics on trapezoidal words and \(k\)-inversion sequences
- A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples
- On \(\underline{12} 0\)-avoiding inversion and ascent sequences
- Counting inversion sequences by parity successions and runs
- Restricted ascent sequences and Catalan numbers
- Inversion sequences avoiding pairs of patterns
- Equivalence of the descents statistic on some (4,4)-avoidance classes of permutations
- Further enumeration results concerning a recent equivalence of restricted inversion sequences
- Enumeration of smooth inversion sequences and proof of a recent related conjecture
- 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
- A bijection for length-5 patterns in permutations
- 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
- Inversion sequences avoiding quadruple length-3 patterns
- Inversion sequences avoiding 021 and another pattern of length four
- Modified ascent sequences avoiding a pattern of length 4
- Pattern avoidance in revised ascent sequences
- Sorting inversion sequences
- 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: Patterns of relation triples in inversion and ascent sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2283035)
