Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
From MaRDI portal
Publication:2422019
DOI10.1016/j.tcs.2019.02.003zbMath1427.05003arXiv1808.04114OpenAlexW2887852849WikidataQ128421496 ScholiaQ128421496MaRDI QIDQ2422019
Nicholas R. Beaton, Mathilde Bouvel, Veronica Guerrini, Simone Rinaldi
Publication date: 18 June 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.04114
generating treesCatalan numberspattern avoiding permutationsBaxter numberspattern avoiding inversion sequences
Related Items (19)
Scaling and local limits of Baxter permutations and bipolar orientations through coalescent-walk processes ⋮ Consecutive patterns in inversion sequences II: avoiding patterns of relations ⋮ Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels ⋮ Inversion sequences avoiding pairs of patterns ⋮ Restricted inversion sequences and Schröder paths ⋮ Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers ⋮ 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 ⋮ A bijection for length-5 patterns in permutations ⋮ An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences ⋮ Inversion sequences avoiding consecutive patterns ⋮ Pattern-avoiding inversion sequences and open partition diagrams ⋮ A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples ⋮ On \(\underline{12} 0\)-avoiding inversion and ascent sequences ⋮ Patterns of relation triples in inversion and ascent sequences ⋮ Vincular patterns in inversion sequences ⋮ Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences ⋮ Combinatorics of the symmetries of ascents in restricted inversion sequences
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Enumeration schemes for vincular patterns
- Pattern avoidance in ascent sequences
- On partitions avoiding 3-crossings
- Skew Dyck paths
- The method of creative telescoping
- The number of Baxter permutations
- Generating functions for generating trees
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Generalized permutation patterns and a classification of the Mahonian statistics
- The umbral transfer-matrix method. I: Foundations
- Generating trees and the Catalan and Schröder numbers
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
- Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences
- Some Wilf-equivalences for vincular patterns
- Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
- Partially directed paths in a wedge
- Asymptotic enumeration of permutations avoiding generalized patterns
- 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
- ECO:a methodology for the enumeration of combinatorial objects
- Refined restricted inversion sequences
This page was built for publication: Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
