Inversion sequences avoiding a triple of patterns of 3 letters (Q6133161)

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\}\).