Have a personal or library account? Click to login
Computing abelian subalgebras for linear algebras of upper-triangular matrices from an algorithmic perspective Cover

Computing abelian subalgebras for linear algebras of upper-triangular matrices from an algorithmic perspective

Open Access
|Sep 2017

Abstract

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.

DOI: https://doi.org/10.1515/auom-2016-0032 | Journal eISSN: 1844-0835 | Journal ISSN: 1224-1784
Language: English
Page range: 137 - 147
Submitted on: Sep 16, 2014
Accepted on: Feb 16, 2015
Published on: Sep 21, 2017
Published by: Ovidius University of Constanta
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year

© 2017 Manuel Ceballos, Juan Núñez, Ángel F. Tenorio, published by Ovidius University of Constanta
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.