Fast computation of weight multiplicities
This paper discusses a Pascal implementation of a fast recursion formula for multiplicities of dominant weights in finite-dimensional irreducible modules for simple complex Lie algebras. The program, developed on the CDC Cyber 835, computes the dominant weights and multiplicities, based on an algorithm, described by \textit{R. V. Moody} and \textit{J. Patera} [Bull. Am. Math. Soc., New Ser. 7, 237-242 (1982; Zbl 0494.17005)]. An example is given of the program's execution with 58 dominant weights and multiplicities of an \(E_ 8\)-module of dimension \(3.191.795.712.000,\) determined in under 13 seconds. One can ask, whether another (improved?) programming could have been achieved, if the author had been acquainted with \textit{H. Freudenthal}'s paper [L'avantage de l'usage de bases symétriques pour des calculs dans les algèbres de Lie simples, Bull. Soc. Math. Belg., Sér. A 38, 201- 208 (1986; Zbl 0628.17004)].
- An algorithm for computing weight multiplicities in irreducible modules for complex semisimple Lie algebras
- Character calculations for semisimple Lie algebras
- \texttt{Affine.m} -- \texttt{Mathematica} package for computations in representation theory of finite-dimensional and affine Lie algebras
- Some new generating functions for weight multiplicities
- On weight multiplicities of complex simple Lie algebras
- Computers in Lie algebras. I: Calculation of Inner Multiplicities
- Determining multiplicities of dominant weights in irreducible lie algebra representations using a computer
- Fast recursion formula for weight multiplicities
- scientific article; zbMATH DE number 3887896 (Why is no real title available?)
- scientific article; zbMATH DE number 3125391 (Why is no real title available?)
- scientific article; zbMATH DE number 3384236 (Why is no real title available?)
- scientific article; zbMATH DE number 3094296 (Why is no real title available?)
- Introduction to Lie Algebras and Representation Theory
- The maximal subgroups of the classical groups
- Weight diagrams for lie group representations: A computer implementation of Freudenthal's algorithm in ALGOL and FORTRAN
- Structure of certain Weyl modules for the spin groups
- Fast evaluation, weights and nonlinearity of rotation-symmetric functions
- Fast algorithms for weighted myriad computation by fixed-point search
- An algorithm for computing weight multiplicities in irreducible modules for complex semisimple Lie algebras
- Orbit–orbit branching rules between simple low-rank algebras and equal-rank subalgebras
- Orbit–orbit branching rules for families of classical Lie algebra–subalgebra pairs
This page was built for publication: Fast computation of weight multiplicities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1100268)