RS-complete cycle decompositions
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.)
- Alternating permutations with restrictions and standard Young tableaux
- An extension of Schensted's theorem
- Generalized Robinson-Schensted-Knuth correspondence
- scientific article; zbMATH DE number 1001729 (Why is no real title available?)
- scientific article; zbMATH DE number 3935040 (Why is no real title available?)
- Longest Increasing and Decreasing Subsequences
- On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
- On the Representations of the Symmetric Group
- Pattern avoidance for alternating permutations and Young tableaux
- Permutations, matrices, and generalized Young tableaux
- Restricted permutations
This page was built for publication: RS-complete cycle decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562430)
