Inversion sequences of length $n$ are integer sequences $e_1,\ldots ,e_n$ with $0\le e_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.
@article{10_37236_10948,
author = {Letong Hong and Rupert Li},
title = {Length-four pattern avoidance in inversion sequences},
journal = {The electronic journal of combinatorics},
year = {2022},
volume = {29},
number = {4},
doi = {10.37236/10948},
zbl = {1506.05006},
url = {http://geodesic.mathdoc.fr/articles/10.37236/10948/}
}
TY - JOUR
AU - Letong Hong
AU - Rupert Li
TI - Length-four pattern avoidance in inversion sequences
JO - The electronic journal of combinatorics
PY - 2022
VL - 29
IS - 4
UR - http://geodesic.mathdoc.fr/articles/10.37236/10948/
DO - 10.37236/10948
ID - 10_37236_10948
ER -
%0 Journal Article
%A Letong Hong
%A Rupert Li
%T Length-four pattern avoidance in inversion sequences
%J The electronic journal of combinatorics
%D 2022
%V 29
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/10948/
%R 10.37236/10948
%F 10_37236_10948
Letong Hong; Rupert Li. Length-four pattern avoidance in inversion sequences. The electronic journal of combinatorics, Tome 29 (2022) no. 4. doi: 10.37236/10948
