Lie algebraic computation
โ Scribed by A.M. Cohen; W.A. de Graaf
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 543 KB
- Volume
- 97
- Category
- Article
- ISSN
- 0010-4655
No coin nor oath required. For personal study only.
โฆ Synopsis
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 bigger project, called ACELA and financed by STW, the Dutch Technology Foundation, which aims at an interactive book on Lie algebras.
๐ 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
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