4 papers
Iterating the Lehmer code on inversion sequences: Catalan fixed points and finite stabilization
Julian Allagan, Shanzhen Gao, Benjamin Testart
We study an operator on finite integer sequences, where counts the entries to the left of that are strictly smaller than . This operator is a variant of the…
On minimal pattern-containing inversion sequences
Benjamin Testart
We introduce the notion of minimal inversion sequences for a pattern , which form the smallest set of inversion sequences whose avoidance is equivalent to the avoidance of f…
Generating trees growing on the left for pattern-avoiding inversion sequences
Benjamin Testart
This work concerns a construction of pattern-avoiding inversion sequences from right to left we call the generating tree growing on the left. We first apply this construction to in…
Completing the enumeration of inversion sequences avoiding one or two patterns of length 3
Benjamin Testart
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 en…