A Schensted Algorithm Which Models Tensor Representations of the Orthogonal Group
- 1 February 1990
- journal article
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 42 (1) , 28-49
- https://doi.org/10.4153/cjm-1990-002-1
Abstract
This paper is concerned with a combinatorial construction which mysteriously “mimics” or “models” the decomposition of certain reducible representations of orthogonal groups. Although no knowledge of representation theory is needed to understand the body of this paper, a little familiarity is necessary to understand the representation theoretic motivation given in the introduction. Details of the proofs will most easily be understood by people who have had some exposure to Schensted's algorithm or jeu de tacquin.Keywords
This publication has 1 reference indexed in Scilit:
- Interconnections between symplectic and orthogonal charactersContemporary Mathematics, 1989