Artículo
Computing abelian subalgebras for linear algebras of upper-triangular matrices from an algorithmic perspective
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 | 2016 |
Fecha de depósito | 2016-12-05 |
Publicado en |
|
Resumen | In this paper, the maximal abelian dimension is algorithmically and
computationally studied for the Lie algebra hn, of n×n upper-triangular
matrices. More concretely, we define an algorithm to compute abelian
subalgebras ... In this paper, the maximal abelian dimension is algorithmically and computationally studied for the Lie algebra hn, of n×n upper-triangular matrices. More concretely, we define an algorithm to compute abelian subalgebras of hn besides programming its implementation with the symbolic computation package MAPLE. The algorithm returns a maximal abelian subalgebra of hn and, hence, its maximal abelian dimension. The order n of the matrices hn is the unique input needed to obtain these subalgebras. Finally, a computational study of the algorithm is presented and we explain and comment some suggestions and comments related to how it works. |
Cita | Ceballos González, M., Núñez Valdés, J. y Tenorio Villalón, Á.F. (2016). Computing abelian subalgebras for linear algebras of upper-triangular matrices from an algorithmic perspective. Analele Stiintifice ale Universitatii Ovidius Constanta. Seria Matematica, 24 (2), 137-148. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Computing abelian subalgebras ... | 863.7Kb | [PDF] | Ver/ | |