Completing the enumeration of inversion sequences avoiding triples of relations

Abstract

An inversion sequence of length $n$ is an integer sequence $(a_1,\dots ,a_n)$ such that $0\le a_i<i$ for all $i$. The study of pattern-avoiding inversion sequences was initiated in 2015 by Mansour and Shattuck and in 2016 by Corteel, Martinez, Savage and Weselcouch. Martinez and Savage later defined a new type of pattern, a triple of binary relations, of which there are currently 14 uncounted avoidance classes. We complete the enumeration for all of these classes using generating tree methods "growing on the left" and "growing on the right". For many of these classes we are able to find algebraic generating functions. We also discuss the asymptotic behaviour of the counting sequences.

Added further details for some calculations of solutions, a new appendix explaining asymptotic estimates, and a Mathematica notebook as an ancillary file. Various other minor corrections and tweaks