Inversion sequences avoiding a triple of patterns of 3 letters
Summary: An inversion sequence of length \(n\) is a sequence of integers \(e=e_1\cdots e_n\) which satisfies for each \(i\in[n]=\{1,2,\ldots,n\}\) the inequality \(0\leqslant e_i < i\). For a set of patterns \(P\), we let \(I_n(P)\) denote the set of inversion sequences of length \(n\) that avoid all the patterns from~\(P\). We say that two sets of patterns \(P\) and \(Q\) are \(I\)-Wilf-equivalent if \(|I_n(P)|=|I_n(Q)|\) for every~\(n\). In this paper, we show that the number of \(I\)-Wilf-equivalence classes among triples of length-3 patterns is \(137, 138\) or~\(139\). In particular, to show that this number is exactly \(137\), it remains to prove \(\{101,102,110\}\stackrel{I}{\sim}\{021,100,101\}\) and \(\{100,110,201\}\stackrel{I}{\sim}\{100,120,210\}\).
- Length-four pattern avoidance in inversion sequences
- Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
- Consecutive patterns in inversion sequences
- Wilf equivalences between vincular patterns in inversion sequences
- Inversion sequences avoiding consecutive patterns
- An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
- Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
- Enumeration of inversion sequences avoiding triples of relations
- Further enumeration results concerning a recent equivalence of restricted inversion sequences
- Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
- Inversion sequences avoiding pairs of patterns
- Kernel method and linear recurrence system
- On (shape-)Wilf-equivalence for words
- On 0012-avoiding inversion sequences and a conjecture of Lin and Ma
- On \(\underline{12} 0\)-avoiding inversion and ascent sequences
- On pattern-avoiding partitions
- Pattern avoidance in inversion sequences
- Patterns in inversion sequences. I.
- Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
- Patterns of relation triples in inversion and ascent sequences
- Restricted inversion sequences and enhanced 3-noncrossing partitions
- Restricted inversion sequences and Schröder paths
- Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence
- Statistics on bargraphs of inversion sequences of permutations
- Vincular patterns in inversion sequences
- Wilf equivalences between vincular patterns in inversion sequences
- Patterns in inversion sequences. I.
- Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
- Consecutive patterns in inversion sequences
- scientific article; zbMATH DE number 2192121 (Why is no real title available?)
- scientific article; zbMATH DE number 5181754 (Why is no real title available?)
- Three classes of inversion sequences counted by large Schröder numbers
- An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
- Inversion sequences avoiding a pair of patterns of type (2,1)
- Inversion sequences avoiding quadruple length-3 patterns
- Inversion sequences avoiding 021 and another pattern of length four
- 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
This page was built for publication: Inversion sequences avoiding a triple of patterns of 3 letters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133161)
