Orthogonal tableaux and an insertion algorithm for SO(2n + 1)

Journal of Combinatorial Theory, Series A - Tập 53 Số 2 - Trang 239-256 - 1990
Sheila Sundaram1
1Department of Mathematics University of Michigan, Ann Arbor, Michigan 48109, USA

Tóm tắt

Từ khóa


Tài liệu tham khảo

Berele, 1984, A Schensted-type correspondence for the symplectic group, J. Combin. Theory Ser. A, 43, 320, 10.1016/0097-3165(86)90070-1

Burge, 1974, Four correspondences between graphs and generalized Young tableaux, J. Combin. Theory Ser. A, 17, 12, 10.1016/0097-3165(74)90024-7

Hanlon, 1984, An introduction to the complex representations of the symmetric group and general linear Lie algebra, Vol. 34

King, 1975, Weight multiplicities for the classical groups, Vol. 50, 490

King, 1971, Modification rules and products of irreducible representations of the unitary, orthogonal and symplectic groups, J. Math. Phys., 12, 10.1063/1.1665778

Knuth, 1970, Permutations, matrices and generalized Young tableaux, Pacific J. Math., 34, 10.2140/pjm.1970.34.709

Koike, 1987

Littlewood, 1950

Macdonald, 1979

Proctor, 1985

Proctor, 1989, Interconnections between orthogonal and symplectic characters, Vol. 88

Schensted, 1961, Longest increasing and decreasing subsequences, Canad. J. Math., 13, 179, 10.4153/CJM-1961-015-3

Schur, 1901

reprinted in “Gesammelte Abhandlungen,” Vol. 1, pp. 1–72.

Schützenberger, 1977, La correspondance de Robinson, Vol. 579

Stanley, 1983, Gl(n, C) for combinatorialists, Vol. 82, 187

Sundaram, 1986, On the Combinatorics of Representations of Sp(2n, C)

Sundaram, 1990, The Cauchy identity for Sp(2n), J. Combin. Theory Ser. A, 53, 209, 10.1016/0097-3165(90)90058-5

Weyl, 1946