A Robinson-Schensted-type algorithm for SO(2n, C )
- 30 November 1991
- journal article
- Published by Elsevier in Journal of Algebra
- Vol. 143 (2) , 334-372
- https://doi.org/10.1016/0021-8693(91)90269-e
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Orthogonal tableaux and an insertion algorithm for SO(2n + 1)Journal of Combinatorial Theory, Series A, 1990
- A Schensted Algorithm Which Models Tensor Representations of the Orthogonal GroupCanadian Journal of Mathematics, 1990
- Young diagrammatic methods for the restriction of representations of complex classical Lie groups to reductive subgroups of maximal rankAdvances in Mathematics, 1990
- A schensted-type correspondence for the symplectic groupJournal of Combinatorial Theory, Series A, 1986
- Standard Young tableaux and weight multiplicities of the classical Lie groupsJournal of Physics A: General Physics, 1983
- Longest Increasing and Decreasing SubsequencesCanadian Journal of Mathematics, 1961
- On the Representations of the Symmetric GroupAmerican Journal of Mathematics, 1938