Inversion sequences avoiding pairs of patterns
From MaRDI portal
Abstract: The enumeration of inversion sequences avoiding a single pattern was initiated by Corteel--Martinez--Savage--Weselcouch and Mansour--Shattuck independently. Their work has sparked various investigations of generalized patterns in inversion sequences, including patterns of relation triples by Martinez and Savage, consecutive patterns by Auli and Elizalde, and vincular patterns by Lin and Yan. In this paper, we carried out the systematic study of inversion sequences avoiding two patterns of length . Our enumerative results establish further connections to the OEIS sequences and some classical combinatorial objects, such as restricted permutations, weighted ordered trees and set partitions. Since patterns of relation triples are some special multiple patterns of length , our results complement the work by Martinez and Savage. In particular, one of their conjectures regarding the enumeration of -avoiding inversion sequences is solved.
Recommendations
Cites work
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- A bijection between atomic partitions and unsplitable partitions
- A new decomposition of ascent sequences and Euler-Stirling statistics
- A sextuple equidistribution arising in pattern avoidance
- Ascent sequences and 3-nonnesting set partitions
- Ascent sequences and the binomial convolution of Catalan numbers
- Ascent sequences avoiding pairs of patterns
- Catalan Numbers
- Consecutive patterns in inversion sequences
- Consecutive patterns in inversion sequences. II: Avoiding patterns of relations
- Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
- Enumeration of inversion sequences avoiding triples of relations
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Generating permutations with restricted containers
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- Pattern avoidance in ascent sequences
- Pattern avoidance in inversion sequences
- Patterns in inversion sequences. I.
- Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
- Patterns in permutations and words.
- Patterns of relation triples in inversion and ascent sequences
- Restricted inversion sequences and enhanced 3-noncrossing partitions
- Restricted permutations
- Schubert polynomials and the Littlewood-Richardson rule
- Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence
- Some combinatorial properties of Schubert polynomials
- The mathematics of lecture hall partitions
- Two examples of unbalanced Wilf-equivalence
- Vincular patterns in inversion sequences
Cited in
(43)- Enumeration of inversion sequences avoiding triples of relations
- Combinatorics of the symmetries of ascents in restricted inversion sequences
- Length-four pattern avoidance in 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
- Ascent sequences avoiding pairs of patterns
- Vincular patterns in inversion sequences
- Two characterizations of the shape of the base poset derived from the Lehmer code of a permutation using permutation patterns.
- Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
- Inverse invariant zero-nonzero patterns
- Doubled patterns with reversal and square-free doubled patterns
- Patterns in inversion sequences. I.
- Pattern avoidance in inversion sequences
- Pattern Avoidance in Reverse Double Lists
- Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
- Equivalence of the descents statistic on some (4,4)-avoidance classes of permutations
- Consecutive patterns in inversion sequences. II: Avoiding patterns of relations
- Further enumeration results concerning a recent equivalence of restricted inversion sequences
- Generating Trees for 0021-Avoiding Inversion Sequences and a Conjecture of Hong and Li
- Three classes of inversion sequences counted by large Schröder numbers
- 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
- scientific article; zbMATH DE number 7708728 (Why is no real title available?)
- An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
- Inversion sequences avoiding quadruple length-3 patterns
- Inversion sequences avoiding 021 and another pattern of length four
- Bijections on pattern avoiding inversion sequences and related objects
- Completing the enumeration of inversion sequences avoiding one or two patterns of length 3
- Asymptotic normality for the count of distinct entries in uniformly random inversion sequences avoiding 010 and 0211
- Patterns in rectangulations. I: -like patterns, inversion sequence classes I(010, 101, 120, 201) and I(011, 201), and rushed Dyck paths
- Generating trees growing on the left for pattern-avoiding inversion sequences
- Inversion sequences avoiding a set of length-3 patterns
- Sorting inversion sequences
- Inversion sequences avoiding {120,210} and another pattern of length three
- The enumeration of inversion sequences avoiding the patterns 201 and 210
- An explicit bijection between the inversion sequences avoiding 0312 and 0321
- On 102-avoiding inversion sequences
- Enumeration of inversion sequences avoiding 010 and some patterns of length four
This page was built for publication: Inversion sequences avoiding pairs of patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386620)
