Length-four pattern avoidance in inversion sequences
From MaRDI portal
Abstract: Inversion sequences of length are integer sequences with for all , which are in bijection with the permutations of length . In this paper, we classify all Wilf equivalence classes of pattern-avoiding inversion sequences of length-4 patterns except for one case (whether 3012 3201) and enumerate some of the length-4 pattern-avoiding inversion sequences that are in the OEIS.
Recommendations
- Pattern avoidance in inversion sequences
- Inversion sequences avoiding pairs of patterns
- Inversion sequences avoiding consecutive patterns
- Consecutive patterns in inversion sequences. II: Avoiding patterns of relations
- Consecutive patterns in inversion sequences
- Vincular patterns in inversion sequences
- Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
- Permutations avoiding certain patterns: The case of length 4 and some generalizations
- Longest increasing subsequences in involutions avoiding patterns of length three
- Pattern avoidance in ascent sequences
Cites work
- A survey of alternating permutations
- Consecutive patterns in inversion sequences
- Consecutive patterns in inversion sequences. II: Avoiding patterns of relations
- Ehrhart series of lecture hall polytopes and Eulerian polynomials for inversion sequences
- Forests of label-increasing trees
- scientific article; zbMATH DE number 3156373 (Why is no real title available?)
- Increasing trees and alternating permutations
- Inversion sequences avoiding pairs of patterns
- Pattern avoidance in inversion sequences
- Patterns in inversion sequences. I.
- Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
- Restricted permutations
- The on-line encyclopedia of integer sequences
- Vincular patterns in inversion sequences
- Wilf equivalences between vincular patterns in inversion sequences
Cited in
(21)- Pattern avoidance in inversion sequences
- Consecutive patterns in 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
- Five classes of pattern avoiding inversion sequences under one roof: generating trees
- On 0012-avoiding inversion sequences and a conjecture of Lin and Ma
- Inversion sequences avoiding a triple of patterns of 3 letters
- An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
- Burstein’s permutation conjecture, Hong and Li’s inversion sequence conjecture and restricted Eulerian distributions
- Inversion sequences avoiding a pair of patterns of type (2,1)
- Subsequence frequency in binary words
- 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
- Sorting permutations using a pop stack with a bypass
- Asymptotic normality for the count of distinct entries in uniformly random inversion sequences avoiding 010 and 0211
- Generating trees growing on the left for pattern-avoiding inversion sequences
- Inversion sequences avoiding {120,210} and another pattern of length three
- 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: Length-four pattern avoidance in inversion sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2112575)