Length-Four Pattern Avoidance in Inversion Sequences

Abstract

Inversion sequences of length $n$ are integer sequences $e_1,\dots ,e_n$ with $0\le e_i<i$ for all $i$, which are in bijection with the permutations of length $n$. In this paper, we classify all Wilf equivalence classes of pattern-avoiding inversion sequences of length-4 patterns except for one case (whether 3012 $\equiv$ 3201) and enumerate some of the length-4 pattern-avoiding inversion sequences that are in the OEIS.

To appear in Electronic Journal of Combinatorics. 15 pages

References in corpus (1)

• Consecutive patterns in inversion sequences II: avoiding patterns of relations

Cited by in corpus (1)

• An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences