Generalization of the Schensted algorithm for rim hook tableaux
From MaRDI portal
Recommendations
Cites work
- A bijection proving orthogonality of the characters of \(S_ n\)
- A Schensted algorithm for rim hook tableaux
- A Schensted-type correspondence for the symplectic group
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 637450 (Why is no real title available?)
- Longest Increasing and Decreasing Subsequences
- Permutations, matrices, and generalized Young tableaux
- Robinson-Schensted algorithms for skew tableaux
- Shifted tableaux, Schur q-functions, and a conjecture of R. Stanley
Cited in
(9)- A Schensted algorithm for rim hook tableaux
- Color-to-spin ribbon Schensted algorithms
- Uncrowding algorithm for hook-valued tableaux
- scientific article; zbMATH DE number 6683604 (Why is no real title available?)
- scientific article; zbMATH DE number 3898898 (Why is no real title available?)
- Jeu-de-taquin promotion and a cyclic sieving phenomenon for semistandard hook tableaux
- scientific article; zbMATH DE number 637450 (Why is no real title available?)
- Signed enumeration of ribbon tableaux: an approach through growth diagrams
- A refinement of the Murnaghan-Nakayama rule by descents for border strip tableaux
This page was built for publication: Generalization of the Schensted algorithm for rim hook tableaux
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5216600)