A Robinson-Schensted-type algorithm for \(SO(2n,\mathbb{C})\)

DOI10.1016/0021-8693(91)90269-EzbMath0759.20014OpenAlexW2021715494MaRDI QIDQ1178894

Soichi Okada

Publication date: 26 June 1992

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-8693(91)90269-e

zbMATH Keywords

irreducible representationtableauxirreducible charactersspecial orthogonal groupgeneral linear grouptensor productRobinson-Schensted algorithmcharacter identitysigned \(SO(2n)\)-tableau

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Representation theory for linear algebraic groups (20G05) Linear algebraic groups over the reals, the complexes, the quaternions (20G20)

Related Items

Descent sets for symplectic groups, A new tableau model for representations of the special orthogonal group, Random walks in Weyl chambers and the decomposition of tensor powers, Reflection and algorithm proofs of some more Lie group dual pair identities, Flagged Littlewood-Richardson tableaux and branching rule for classical groups, Crystal bases and combinatorics of infinite rank quantum groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orthogonal tableaux and an insertion algorithm for \(SO(2n+1)\)
• Young diagrammatic methods for the restriction of representations of complex classical Lie groups to reductive subgroups of maximal rank
• A Schensted-type correspondence for the symplectic group
• Longest Increasing and Decreasing Subsequences
• A Schensted Algorithm Which Models Tensor Representations of the Orthogonal Group
• Standard Young tableaux and weight multiplicities of the classical Lie groups