Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 1

Search results for: Solvable Lie algebra

1 Computational Algorithm for Obtaining Abelian Subalgebras in Lie Algebras

Authors: Manuel Ceballos, Juan Nunez, Angel F. Tenorio

Abstract:

The set of all abelian subalgebras is computationally obtained for any given finite-dimensional Lie algebra, starting from the nonzero brackets in its law. More concretely, an algorithm is described and implemented to compute a basis for each nontrivial abelian subalgebra with the help of the symbolic computation package MAPLE. Finally, it is also shown a brief computational study for this implementation, considering both the computing time and the used memory.

Keywords: Algorithm, Solvable Lie algebra, maximal abelian dimension

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 926