Geodesic
A Schensted Algorithm Which Models Tensor Representations of the Orthogonal Group
Canadian journal of mathematics, Tome 42 (1990) no. 1, pp. 28-49

Voir la notice de l'article provenant de la source Cambridge University Press

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. 
Proctor, Robert A. A Schensted Algorithm Which Models Tensor Representations of the Orthogonal Group. Canadian journal of mathematics, Tome 42 (1990) no. 1, pp. 28-49. doi: 10.4153/CJM-1990-002-1
@article{10_4153_CJM_1990_002_1,
     author = {Proctor, Robert A.},
     title = {A {Schensted} {Algorithm} {Which} {Models} {Tensor} {Representations} of the {Orthogonal} {Group}},
     journal = {Canadian journal of mathematics},
     pages = {28--49},
     year = {1990},
     volume = {42},
     number = {1},
     doi = {10.4153/CJM-1990-002-1},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1990-002-1/}
}
TY  - JOUR
AU  - Proctor, Robert A.
TI  - A Schensted Algorithm Which Models Tensor Representations of the Orthogonal Group
JO  - Canadian journal of mathematics
PY  - 1990
SP  - 28
EP  - 49
VL  - 42
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1990-002-1/
DO  - 10.4153/CJM-1990-002-1
ID  - 10_4153_CJM_1990_002_1
ER  - 
%0 Journal Article
%A Proctor, Robert A.
%T A Schensted Algorithm Which Models Tensor Representations of the Orthogonal Group
%J Canadian journal of mathematics
%D 1990
%P 28-49
%V 42
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1990-002-1/
%R 10.4153/CJM-1990-002-1
%F 10_4153_CJM_1990_002_1

[1] 1. Berele, A., A Schensted-type correspondence for the symplectic group, J. Combin. Theory A 43 (1986), 320–328. Google Scholar

[2] 2. Berele, A. and Regev, A., Hook Young diagrams, combinatorics and representations of Lie superalgebras, Bull. AMS 8 (1983), 337–339. Google Scholar

[3] 3. King, R.C. and El-Sharkaway, N.G.I., Standard Young tableaux and weight multiplicities of the classical Lie groups, J. Physics A 16 (1983), 3153–3178. Google Scholar

[4] 4. Koike, K. and Terada, I., Young-diagrammatic methods for the restriction of representations of complex classical Lie groups to reductive subgroups of maximal rank, Advances in Math., to appear. Google Scholar

[5] 5. Hanlon, P. and Wales, D., On the decomposition of Brauer s centralizer algebras, J. Algebra, to appear. Google Scholar

[6] 6. Proctor, R., Young tableaux, Gelfand patterns, and branching rules for classical Lie groups, preprint. Google Scholar

[7] 7. Proctor, R., A generalized Berele-Schensted algorithm and conjectured Young tableaux for intermediate symplectic groups, Trans. AMS, to appear. Google Scholar

[8] 8. Proctor, R., Interconnections between symplectic and orthogonal characters, in Proceedings of a special session on invariant theory, Contemporary Mathematics (Amer. Math. Soc, Providence, 1989). Google Scholar

[9] 9. Schensted, C., Longest increasing and decreasing subsequences, Can. J. Math. 13 (1961), 179— 191. Google Scholar

[10] 10. Stembridge, J., Rational tableaux and the tensor algebra of gln, J. Combin. Theory A 46 (1987), 79–120. Google Scholar

[11] 11. Sundaram, S., Orthogonal tableaux and an insertion algorithm for SO(2n+l), J. Combin. Theory A, to appear. Google Scholar

[12] 12. Sundaram, S., On the combinatorics of representations of Sp(2n,C), doctoral thesis, M.I.T. (1986). Google Scholar

[13] 13. Sundaram, S., The Cauchy identity for Sp(2n), J. Combin. Theory A, to appear. Google Scholar

[14] 14. Weyl, H., The classical groups, 2nd ed (Princeton University Press, Princeton, 1946). Google Scholar

Cité par Sources :