Recursive Algorithms for Unitary and Symplectic Group Representations

DOI10.1137/0603060zbMath0496.22024MaRDI QIDQ3961048

Kenneth Baclawski

Publication date: 1982

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0603060

zbMATH Keywords

irreducible representations; lexicographic algorithms

Mathematics Subject Classification ID

81R10: Infinite-dimensional groups and algebras motivated by physics, including Virasoro, Kac-Moody, (W)-algebras and other current algebras and their representations

22E70: Applications of Lie groups to the sciences; explicit representations

22C05: Compact groups

Related Items

Remarks on tensor operators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symplectic standard tableaux
• Young diagrams and determinantal varieties
• Young symmetry, the flag manifold, and representations of GL(n)
• Representation-functors and flag-algebras for the classical groups. I
• Rings with lexicographic straightening law
• A characteristic free approach to invariant theory
• Two new functors from modules to algebras
• A characteristic-free approach to the representation theory of \(\mathfrak S_n\)
• Character generators for unitary and symplectic groups
• The Shape-Algebra and Standard Bases for G 2
• On the Foundations of Combinatorial Theory: IX Combinatorial Methods in Invariant Theory
• The Schensted Correspondence and Lexicographic Matchings on Multisubset Lattices
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• Solution of Two Difficult Combinatorial Problems with Linear Algebra
• On the Representations of the Semisimple Lie Groups. II
• Branching Theorem for the Symplectic Groups
• Introduction to Lie Algebras and Representation Theory
• The Base for Algebraic Varieties of Given Dimension on a Grassmannian Variety