Character generators for unitary and symplectic groups

DOI10.1063/1.525912zbMATH Open0518.22014OpenAlexW2054055811MaRDI QIDQ3667099FDOQ3667099

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

Young tableauxcombinatorial algorithmsbranching rulesexceptional Lie group G2Gel'fand patternsreductive Lie groupscharacter generators

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Character generators for elements of finite order in simple Lie groups A1, A2, A3, B2, and G2
• Generating functions for orthogonal polynomials of \(A_{2}\), \(C_{2}\) and \(G_{2}\)
• Shifted Plane Partitions of Trapezoidal Shape
• 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)