Computational algorithm for obtaining Abelian subalgebras in Lie algebras

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 symbol...

Descripción completa

Detalles Bibliográficos
Autores: Ceballos González, Manuel, Núñez Valdés, Juan, Tenorio Villalón, Ángel Francisco
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2009
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/47966
Acceso en línea:http://hdl.handle.net/11441/47966
Access Level:acceso abierto
Palabra clave:Solvable Lie algebra
Maximal abelian dimension
Algorithm
id ES_f55bfc4b20dd6ca4df08fc86ad61611a
oai_identifier_str oai:idus.us.es:11441/47966
network_acronym_str ES
network_name_str España
repository_id_str
spelling Computational algorithm for obtaining Abelian subalgebras in Lie algebrasCeballos González, ManuelNúñez Valdés, JuanTenorio Villalón, Ángel FranciscoSolvable Lie algebraMaximal abelian dimensionAlgorithmThe 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.World Academy of Science, Engineering and TechnologyGeometría y TopologíaFQM326: Geometria Diferencial y Teoria de Lie2009info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttp://hdl.handle.net/11441/47966reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésInternational Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering, 3 (10), 879-883.http://waset.org/publications/11417/computational-algorithm-for-obtaining-abelian-subalgebras-in-lie-algebrasinfo:eu-repo/semantics/openAccessoai:idus.us.es:11441/479662026-06-17T12:51:07Z
dc.title.none.fl_str_mv Computational algorithm for obtaining Abelian subalgebras in Lie algebras
title Computational algorithm for obtaining Abelian subalgebras in Lie algebras
spellingShingle Computational algorithm for obtaining Abelian subalgebras in Lie algebras
Ceballos González, Manuel
Solvable Lie algebra
Maximal abelian dimension
Algorithm
title_short Computational algorithm for obtaining Abelian subalgebras in Lie algebras
title_full Computational algorithm for obtaining Abelian subalgebras in Lie algebras
title_fullStr Computational algorithm for obtaining Abelian subalgebras in Lie algebras
title_full_unstemmed Computational algorithm for obtaining Abelian subalgebras in Lie algebras
title_sort Computational algorithm for obtaining Abelian subalgebras in Lie algebras
dc.creator.none.fl_str_mv Ceballos González, Manuel
Núñez Valdés, Juan
Tenorio Villalón, Ángel Francisco
author Ceballos González, Manuel
author_facet Ceballos González, Manuel
Núñez Valdés, Juan
Tenorio Villalón, Ángel Francisco
author_role author
author2 Núñez Valdés, Juan
Tenorio Villalón, Ángel Francisco
author2_role author
author
dc.contributor.none.fl_str_mv Geometría y Topología
FQM326: Geometria Diferencial y Teoria de Lie
dc.subject.none.fl_str_mv Solvable Lie algebra
Maximal abelian dimension
Algorithm
topic Solvable Lie algebra
Maximal abelian dimension
Algorithm
description 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.
publishDate 2009
dc.date.none.fl_str_mv 2009
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11441/47966
url http://hdl.handle.net/11441/47966
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering, 3 (10), 879-883.
http://waset.org/publications/11417/computational-algorithm-for-obtaining-abelian-subalgebras-in-lie-algebras
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv World Academy of Science, Engineering and Technology
publisher.none.fl_str_mv World Academy of Science, Engineering and Technology
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869424582737264640
score 15.300719

Similares en LA Referencia