Repositorio de producción científica de la Universidad de Sevilla

Computational algorithm for obtaining Abelian subalgebras in Lie algebras

Opened Access Computational algorithm for obtaining Abelian subalgebras in Lie algebras
Estadísticas
Icon
Exportar a
Autor: 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: 2009
Publicado en: International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering, 3 (10), 879-883.
Tipo de documento: Artículo
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 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.
Tamaño: 227.0Kb
Formato: PDF

URI: http://hdl.handle.net/11441/47966

Ver versión del editor

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones