An analog of Schensted's algorithm for shifted Young tableaux

DOI10.1016/0097-3165(79)90003-7zbMath0428.05005OpenAlexW2038738479MaRDI QIDQ1137042

Bruce E. Sagan

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(79)90003-7

zbMATH Keywords

permutationsshifted Young tableauxdiagonal elementsequivalence by adjacent transpositionSchensted's algorithm

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Representations of finite symmetric groups (20C30) Enumerative combinatorics (05A99) Projective representations and multipliers (20C25)

Related Items

Duality of graded graphs, Shifted tableaux, Schur q-functions, and a conjecture of R. Stanley, A Schensted algorithm for rim hook tableaux

Cites Work

• An extension of Schensted's theorem
• Permutations, matrices, and generalized Young tableaux
• Longest Increasing and Decreasing Subsequences
• Theory and Application of Plane Partitions: Part 1