Computations in finite-dimensional Lie algebras

Abstract : This paper describes progress made in context with the construction of a general library of Lie algebra algorithms, called ELIAS (Eindhoven Lie Algebra System), within the computer algebra package GAP. A first sketch of the package can be found in Cohen and de Graaf[1]. Since then, in a collaborative effort with G. Ivanyos, the authors have continued to develop algorithms which were implemented in ELIAS by the second author. 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 (cf. Cohen and Meertens [2]). This paper gives a global description of the main ways in which to present Lie algebras on a computer. We focus on the transition from a Lie algebra abstractly given by an array of structure constants to a Lie algebra presented as a subalgebra of the Lie algebra of n×n matrices. We describe an algorithm typical of the structure analysis of a finite-dimensional Lie algebra: finding a Levi subalgebra of a Lie algebra.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 1997, 1, pp.129-138
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00955695
Contributeur : Alain Monteil <>
Soumis le : mercredi 5 mars 2014 - 09:31:46
Dernière modification le : mercredi 29 novembre 2017 - 10:26:16
Document(s) archivé(s) le : jeudi 5 juin 2014 - 10:53:05

Fichier

dm010109.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00955695, version 1

Collections

Citation

A. M. Cohen, W. A. Graaf, L. Rónyai. Computations in finite-dimensional Lie algebras. Discrete Mathematics and Theoretical Computer Science, DMTCS, 1997, 1, pp.129-138. 〈hal-00955695〉

Partager

Métriques

Consultations de la notice

222

Téléchargements de fichiers

387