Published October 2, 2023 | Version v1

Inversion Sequences Avoiding Quadruple Length-3 Patterns

  • 1. University of Wisconsin
  • 2. University of Haifa

Description

An \emph{inversion sequence} of length $n$ is a sequence of integers $e=e_0\dotsb e_n$ which satisfies $0\le e_i \leq i$, for all $i=0,1,\ldots,n$. For a set of patterns $B$, let $\I_n(B)$  be the set of inversion sequences of length $n$ that avoid all the patterns from~$B$. We say that two sets of patterns $B$ and $C$ are \emph{I-Wilf-equivalent} if $|\I_n(B)|=|\I_n(C)|$, for all $n\geq0$.
In this paper, we show that the number of I-Wilf-equivalences among quadruples of length-3 patterns is at least $212$ and at most $215$, where three open cases remain.

Files

x78.pdf

Files (488.8 kB)

Name Size
md5:b1dba7b9f1b48f91eb6451c11197fb4e
488.8 kB Preview Download