Completing the enumeration of inversion sequences avoiding one or two patterns of length 3
Abstract
We present four constructions of inversion sequences, and use them to compute the enumeration sequences of 24 classes of pattern-avoiding inversion sequences. This completes the enumeration of inversion sequences avoiding one or two patterns of length 3. Some of our constructions are based on generating trees. Others involve pattern-avoiding words, which we also count using generating trees. To solve some of these cases, we introduce a generalization of inversion sequences, which we call shifted inversion sequences. Lastly, we briefly discuss the asymptotics of pattern-avoiding inversion sequences, focusing on their exponential or super-exponential behavior.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.