Character generators for unitary and symplectic groups

DOI10.1063/1.525912MaRDI QIDQ3667099zbMATH OpenOpenAlexFDO

Authors Kenneth Baclawski

Publication date 1983

Published in Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1063/1.525912

zbMATH Keywords

branching rulescharacter generatorscombinatorial algorithmsexceptional Lie group G2Gel'fand patternsreductive Lie groupsYoung tableaux

Mathematics Subject Classification ID

Semisimple Lie groups and their representations (22E46) Applications of Lie groups to the sciences; explicit representations (22E70) Numerical methods for trigonometric approximation and interpolation (65T40)

Cites work

• Branching Theorem for the Symplectic Groups
• Finite lattices and Jordan-Hölder sets
• On the Representations of the Semisimple Lie Groups. II
• Rings with lexicographic straightening law
• The character generator of SU(n)

Cited in

(4)

• Generating functions for orthogonal polynomials of \(A_{2}\), \(C_{2}\) and \(G_{2}\)
• Shifted Plane Partitions of Trapezoidal Shape
• Character generators for elements of finite order in simple Lie groups A1, A2, A3, B2, and G2
• Recursive Algorithms for Unitary and Symplectic Group Representations

This page was built for publication: Character generators for unitary and symplectic groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3667099)