Completing the Enumeration of Inversion Sequences Avoiding One or Two Patterns of Length
Benjamin Testart
Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.