Inversion sequences avoiding pairs of patterns
From MaRDI portal
Publication:3386620
DOI10.23638/DMTCS-22-1-23zbMath1460.05007arXiv1912.03674MaRDI QIDQ3386620
Publication date: 5 January 2021
Full work available at URL: https://arxiv.org/abs/1912.03674
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Permutations, words, matrices (05A05)
Related Items (14)
Generating Trees for 0021-Avoiding Inversion Sequences and a Conjecture of Hong and Li ⋮ Equivalence of the descents statistic on some (4,4)-avoidance classes of permutations ⋮ Restricted inversion sequences and Schröder paths ⋮ Five classes of pattern avoiding inversion sequences under one roof: generating trees ⋮ On 0012-avoiding inversion sequences and a conjecture of Lin and Ma ⋮ Parameters in inversion sequences ⋮ Inversion sequences avoiding a triple of patterns of 3 letters ⋮ An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples ⋮ Combinatorics of the symmetries of ascents in restricted inversion sequences ⋮ Further enumeration results concerning a recent equivalence of restricted inversion sequences ⋮ Length-four pattern avoidance in inversion sequences
Uses Software
Cites Work
- Unnamed Item
- A bijection between atomic partitions and unsplitable partitions
- Patterns in permutations and words.
- Pattern avoidance in ascent sequences
- The mathematics of lecture hall partitions
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Schubert polynomials and the Littlewood-Richardson rule
- Some combinatorial properties of Schubert polynomials
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- A sextuple equidistribution arising in pattern avoidance
- Enumeration of inversion sequences avoiding triples of relations
- Restricted inversion sequences and enhanced 3-noncrossing partitions
- Generating permutations with restricted containers
- A new decomposition of ascent sequences and Euler-Stirling statistics
- Ascent sequences avoiding pairs of patterns
- Patterns of relation triples in inversion and ascent sequences
- Vincular patterns in inversion sequences
- Two examples of unbalanced Wilf-equivalence
- Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
- Ascent sequences and 3-nonnesting set partitions
- Ascent sequences and the binomial convolution of Catalan numbers
- Patterns in Inversion Sequences I
- Pattern avoidance in inversion sequences
- Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence
- Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations
- Catalan Numbers
- Consecutive Patterns in Inversion Sequences
- Consecutive patterns in inversion sequences II: avoiding patterns of relations
- Refined restricted inversion sequences
- Restricted permutations
This page was built for publication: Inversion sequences avoiding pairs of patterns
