RS-complete cycle decompositions (Q6562430)

In this paper, the authors introduce a property of sets of permutations \(S \subseteq S_n\) called RS-completeness, which is defined as the image of \(S\) under the Robinson-Schensted (RS) correspondence is the set of all partitions of \(n\) except for the single row and single column shapes. These shapes are avoided as they are special cases corresponding to the identity permutation and reverse permutation (or longest element), respectively. Their main result is a complete classification of whether a fixed conjugacy class is RS-complete. More specifically, they show that only the permutations with a single cycle for all \(n\) and when \(n\) is odd, it could also have a single fixed point (called near-cyclic in the manuscript). (When \(n\) is even, they show the near cyclic permutations do not achieve precisely one partition under the RS correspondence.)