In this paper we describe some basic algorithms for the structure determination of Lie algebras. They are implemented in a general library of Lie algebra algorithms, called ELIAS (for Eindhoven Lie Algebra System) which is built into the computer algebra package GAP. These activities are part of a b
Lie algebra computations
โ Scribed by P. K. H. Gragert
- Publisher
- Springer Netherlands
- Year
- 1989
- Tongue
- English
- Weight
- 479 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0167-8019
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The KILLING package is a set of algebraic computational procedures to manipulate elements of representation theory for classical, exceptional and deformed Lie algebras. It is divided in two major parts: (1) The Roots & Weights formalism to classify all semisimple Lie algebras and their irreducible r
This paper defines a remarkable Lie algebra of infinite dimension and rank, and conjectures that it may be related to the Fischer-Griess Monster group. The idea was discussed in [3] that there might be an infinite-dimensional Lie algebra (or superalgebra) L that in some sense "explains" the Fischer
We describe third power associative multiplications ) on noncentral Lie ideals of prime algebras and skew elements of prime algebras with involution provided w x that x ) y y y ) x s x, y for all x, y and the prime algebras in question do not satisfy polynomial identities of low degree. We also obta
We present a combinatorial algorithm for computing dimensions of irreducible representations of all nine types of simple Lie algebras over complexes. We implemented it on a programmable desk calculator. In conclusion some physical applications are discussed. ## Various formulas have been given [1-3