Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations
From MaRDI portal
Publication:4637126
zbMath1384.05008arXiv1609.08106MaRDI QIDQ4637126
Carla D. Savage, Megan A. Martinez
Publication date: 18 April 2018
Full work available at URL: https://arxiv.org/abs/1609.08106
File on IPFS
Related Items (43)
Generating Trees for 0021-Avoiding Inversion Sequences and a Conjecture of Hong and Li ⋮ Consecutive patterns in inversion sequences II: avoiding patterns of relations ⋮ Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence ⋮ Sorting by shuffling methods and a queue ⋮ The \(\gamma \)-positive coefficients arising in segmented permutations ⋮ 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 ⋮ 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 ⋮ Descent distribution on Catalan words avoiding ordered pairs of relations ⋮ Parameters in inversion sequences ⋮ Inversion sequences avoiding a triple of patterns of 3 letters ⋮ Cauchy–Stieltjes families with polynomial variance functions and generalized orthogonality ⋮ A bijection for length-5 patterns in permutations ⋮ An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences ⋮ Counting inversion sequences by parity successions and runs ⋮ Inversion sequences avoiding consecutive patterns ⋮ Pattern-avoiding inversion sequences and open partition diagrams ⋮ Unnamed Item ⋮ A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples ⋮ On \(\underline{12} 0\)-avoiding inversion and ascent sequences ⋮ Refined restricted inversion sequences ⋮ Enumeration of inversion sequences avoiding triples of relations ⋮ Permutations avoiding bipartite partially ordered patterns have a regular insertion encoding ⋮ Restricted inversion sequences and enhanced 3-noncrossing partitions ⋮ Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions ⋮ Statistics on bargraphs of inversion sequences of permutations ⋮ Patterns of relation triples in inversion and ascent sequences ⋮ Vincular patterns in inversion sequences ⋮ Bijections on pattern avoiding inversion sequences and related objects ⋮ Inversion sequences avoiding quadruple length-3 patterns ⋮ Inversion sequences avoiding 021 and another pattern of length four ⋮ On partially ordered patterns of length 4 and 5 in permutations ⋮ Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations ⋮ A combinatorial bijection on \(k\)-noncrossing partitions ⋮ 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
- Unnamed Item
- Unnamed Item
- Patterns in permutations and words.
- On two unimodal descent polynomials
- The mathematics of lecture hall partitions
- On partitions avoiding 3-crossings
- Schubert polynomials and the Littlewood-Richardson rule
- The number of Baxter permutations
- Some combinatorial properties of Schubert polynomials
- The homology of partitions with an even number of blocks
- Restricted inversion sequences and enhanced 3-noncrossing partitions
- Generating permutations with restricted containers
- Restricted permutations and queue jumping
- Permutations with forbidden subsequences and a generalized Schröder number
- The depth of a permutation.
- Pattern avoidance and the Bruhat order.
- Forest-like permutations
- Ascent sequences and 3-nonnesting set partitions
- Patterns in Inversion Sequences I
- Pattern avoidance in inversion sequences
- Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations
- Simple marked mesh patterns
- Refined restricted inversion sequences
- Restricted permutations
This page was built for publication: Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations
