An algorithm to compute abelian subalgebras in linear algebras of upper-triangular matrices
This paper deals with the maximal abelian dimension of the Lie algebra hn, of nxn upper-triangular matrices. Regarding this, we obtain an algorithm which computes abelian subalgebras of hn as well as its implementation (and a computational study) by using the symbolic computation package MAPLE, wher...
| Authors: | , , |
|---|---|
| Format: | article |
| Status: | Published version |
| Publication Date: | 2009 |
| Country: | España |
| Institution: | Universidad de Sevilla (US) |
| Repository: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/43345 |
| Online Access: | http://hdl.handle.net/11441/43345 https://doi.org/10.1063/1.3225370 |
| Access Level: | Open access |
| Keyword: | Maximal abelian dimension Solvable Lie algebra Algorithmic procedure programming |
| Summary: | This paper deals with the maximal abelian dimension of the Lie algebra hn, of nxn upper-triangular matrices. Regarding this, we obtain an algorithm which computes abelian subalgebras of hn as well as its implementation (and a computational study) by using the symbolic computation package MAPLE, where the order n of the matrices in hn is the unique input needed. Let us note that the algorithm also allows us to obtain a maximal abelian subalgebra of hn. |
|---|