Artículo
Computational algorithm for obtaining Abelian subalgebras in Lie algebras
Autor/es | Ceballos González, Manuel
Núñez Valdés, Juan Tenorio Villalón, Ángel Francisco |
Departamento | Universidad de Sevilla. Departamento de Geometría y Topología |
Fecha de publicación | 2009 |
Fecha de depósito | 2016-10-24 |
Publicado en |
|
Resumen | 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 ... 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. |
Cita | Ceballos González, M., Núñez Valdés, J. y Tenorio Villalón, Á.F. (2009). Computational algorithm for obtaining Abelian subalgebras in Lie algebras. International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering, 3 (10), 879-883. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Computational algorithm for ... | 227.0Kb | [PDF] | Ver/ | |