GENERALIZATION OF THE SCHENSTED ALGORITHM FOR RIM HOOK TABLEAUX
From MaRDI portal
Publication:5216600
DOI10.11568/kjm.2016.24.3.469zbMath1432.05121OpenAlexW2551049906MaRDI QIDQ5216600
Publication date: 18 February 2020
Published in: Korean Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11568/kjm.2016.24.3.469
partitionrim hookhookSchensted algorithmgeneralized hook permutationrim hook tableausemistandard rim hook tableau
Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of representation theory (05E10) Combinatorics of partially ordered sets (06A07)
Cites Work
- Unnamed Item
- Unnamed Item
- A bijection proving orthogonality of the characters of \(S_ n\)
- Robinson-Schensted algorithms for skew tableaux
- A Schensted algorithm for rim hook tableaux
- A Schensted-type correspondence for the symplectic group
- Shifted tableaux, Schur q-functions, and a conjecture of R. Stanley
- Permutations, matrices, and generalized Young tableaux
- Longest Increasing and Decreasing Subsequences
This page was built for publication: GENERALIZATION OF THE SCHENSTED ALGORITHM FOR RIM HOOK TABLEAUX
