Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-00955695
Contributor : Alain Monteil <>
Submitted on : Wednesday, March 5, 2014 - 9:31:46 AM
Last modification on : Wednesday, December 11, 2019 - 5:10:02 PM
Long-term archiving on: : Thursday, June 5, 2014 - 10:53:05 AM

File

dm010109.pdf
Files produced by the author(s)

Identifiers

  • 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⟩

Share

Metrics

Record views

565

Files downloads

1378