RSK-Complete Cycle Decompositions
From MaRDI portal
Abstract: We characterize the class of cycle decompositions that can achieve all Young tableau shapes (except the trivial ones with a single row or a single column) under the Robinson--Schensted--Knuth (RSK) correspondence, a property that we call RSK-completeness. We prove that for even , cyclic permutations comprise the only fixed cycle decomposition that is RSK-complete. For odd , cyclic permutations and almost cyclic permutations which have a cycle of length are the only RSK-complete cycle decompositions.
This page was built for publication: RSK-Complete Cycle Decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6423670)
