A Schensted Algorithm Which Models Tensor Representations of the Orthogonal Group
1990 ◽
Vol 42
(1)
◽
pp. 28-49
◽
Keyword(s):
The Body
◽
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.
2009 ◽
Vol 8
(4)
◽
pp. 693-741
◽
2000 ◽
Vol 69
(1)
◽
pp. 127-142
Keyword(s):
1977 ◽
Vol 20
(2)
◽
pp. 189-198
◽
Keyword(s):
1968 ◽
Vol 8
(3)
◽
pp. 204-227
◽
1998 ◽
Vol 65
(1)
◽
pp. 1-36
◽
1995 ◽
Vol 59
(3)
◽
pp. 353-365
◽
Keyword(s):