Inversion sequences avoiding a triple of patterns of 3 letters
From MaRDI portal
Publication:6133161
DOI10.37236/11603zbMath1519.05003MaRDI QIDQ6133161
David Callan, Vít Jelínek, Toufik Mansour
Publication date: 18 August 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Related Items (1)
Cites Work
- Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
- On pattern-avoiding partitions
- On (shape-)Wilf-equivalence for words
- Enumeration of inversion sequences avoiding triples of relations
- Restricted inversion sequences and enhanced 3-noncrossing partitions
- On \(\underline{12} 0\)-avoiding inversion and ascent sequences
- Patterns of relation triples in inversion and ascent sequences
- Vincular patterns in inversion sequences
- Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
- Kernel method and linear recurrence system
- Wilf equivalences between vincular patterns in inversion sequences
- Patterns in Inversion Sequences I
- Pattern avoidance in inversion sequences
- Inversion sequences avoiding pairs of patterns
- Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence
- Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations
- Statistics on bargraphs of inversion sequences of permutations
- Further enumeration results concerning a recent equivalence of restricted inversion sequences
- Restricted inversion sequences and Schröder paths
- On 0012-avoiding inversion sequences and a conjecture of Lin and Ma
- An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
This page was built for publication: Inversion sequences avoiding a triple of patterns of 3 letters
