Vincular patterns in inversion sequences
From MaRDI portal
Publication:2284074
DOI10.1016/j.amc.2019.124672zbMath1433.05010OpenAlexW2969303935MaRDI QIDQ2284074
Publication date: 14 January 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2019.124672
Bell numbersvincular patternsinversion sequencesascent sequencesFishburn numberspowered Catalan numberssemi-Baxter numbers
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)
Related Items (20)
Generating Trees for 0021-Avoiding Inversion Sequences and a Conjecture of Hong and Li ⋮ Wilf equivalences between vincular patterns in inversion sequences ⋮ Bijections for restricted inversion sequences and permutations with fixed points ⋮ Equivalence of the descents statistic on some (4,4)-avoidance classes of permutations ⋮ Enumeration of smooth inversion sequences and proof of a recent related conjecture ⋮ Inversion sequences avoiding pairs of patterns ⋮ 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 ⋮ Counting inversion sequences by parity successions and runs ⋮ A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples ⋮ On \(\underline{12} 0\)-avoiding inversion and ascent sequences ⋮ Statistics on bargraphs of inversion sequences of permutations ⋮ Combinatorics of the symmetries of ascents in restricted inversion sequences ⋮ Further enumeration results concerning a recent equivalence of restricted inversion sequences ⋮ Weak ascent sequences and related combinatorial structures ⋮ Length-four pattern avoidance in inversion sequences
Cites Work
- Unnamed Item
- Some enumerative results related to ascent sequences
- A permutation code preserving a double Eulerian bistatistic
- Patterns in permutations and words.
- Pattern avoidance in ascent sequences
- On partitions avoiding 3-crossings
- Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Generalized permutation patterns and a classification of the Mahonian statistics
- A sextuple equidistribution arising in pattern avoidance
- Enumeration of inversion sequences avoiding triples of relations
- Restricted inversion sequences and enhanced 3-noncrossing partitions
- On 021-avoiding ascent sequences
- 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
- Ascent sequences and 3-nonnesting set partitions
- 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
- Enumerations of Permutations Simultaneously Avoiding a Vincular and a Covincular Pattern of Length 3
- Refined restricted inversion sequences
- Generalized pattern avoidance
This page was built for publication: Vincular patterns in inversion sequences
