Character generators for unitary and symplectic groups
- 1 July 1983
- journal article
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 24 (7) , 1688-1694
- https://doi.org/10.1063/1.525912
Abstract
Combinatorial algorithms for computing the character generators of U(n), SU(n), and Sp(2n, C) are described. These algorithms produce relatively compact, nested expressions for the character generators. Moreover, the terms appearing in these expressions all have positive coefficients. This feature is not shared by the expression for the character generator which uses the Weyl character formula.Keywords
This publication has 5 references indexed in Scilit:
- Rings with lexicographic straightening lawAdvances in Mathematics, 1981
- The character generator of SU(n)Journal of Mathematical Physics, 1980
- Finite lattices and Jordan-Hölder setsAlgebra universalis, 1974
- Branching Theorem for the Symplectic GroupsJournal of Mathematical Physics, 1967
- On the Representations of the Semisimple Lie Groups. IIJournal of Mathematical Physics, 1963