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
Killing – An algebraic computational package for Lie algebras
✍ Scribed by Esmerindo de Sousa Bernardes
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 276 KB
- Volume
- 130
- Category
- Article
- ISSN
- 0010-4655
No coin nor oath required. For personal study only.
✦ Synopsis
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 representations, and (2) The Gelfand-Tsetlin method to construct explicitly the irreducible representations of classical Lie algebras, including the deformed unitary Lie algebras.
📜 SIMILAR VOLUMES
We observe that any finite-dimensional indecomposable module for a restricted Lie algebra over an algebraically closed field is a module for a finite-dimensional quotient of the universal enveloping algebra. These algebras form a two-parameter family which generalizes the notion of a reduced envelop