Structural characterization of higher stabilization levels

Characterize the structural properties of the permutation sets S_{n,k} and inversion-sequence sets I_{n,k} for each fixed k≥2.

Background

The sets S_{n,k} contain permutations that reach a fixed point after at most k iterations of Θ, while I_{n,k} is the analogous class of inversion sequences. The paper provides a pattern-avoidance characterization for k=1, but shows that the union of the k=2 permutation sets is not closed under classical pattern containment.

Consequently, the higher stabilization levels do not appear to admit a straightforward description within classical permutation-pattern theory. The authors explicitly identify the exact behavior of these levels as largely unexplored, leaving open the task of finding structural characterizations, potentially using methods beyond traditional permutation classes.

References

The exact behavior of higher stabilization levels remains largely unexplored, both from enumerative and structural perspectives.

Iterating the Lehmer code on inversion sequences: Catalan fixed points and finite stabilization  (2608.24476 - Allagan et al., 25 Aug 2026) in Problem 3, labeled Problem higher_intrinsic, Section 5 (Conclusion and open problems)