Now showing items 1-5 of 5
Minimal faithful upper-triangular matrix representations for solvable Lie algebras [Article]
A well-known result on Lie Theory states that every finite-dimensional complex solvable Lie algebra can be represented as a matrix Lie algebra, with upper-triangular square matrices as elements. However, this result does ...
Computational algorithm for obtaining Abelian subalgebras in Lie algebras [Article]
(World Academy of Science, Engineering and Technology, 2009)
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 ...
Computing abelian subalgebras for linear algebras of upper-triangular matrices from an algorithmic perspective [Article]
(Ovidius University, 2016)
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 ...
The computation of Abelian subalgebras in low-dimensional solvable Lie algebras [Article]
(World Scientific and Engineering Academy and Society (WSEAS), 2010-01)
The main goal of this paper is to compute the maximal abelian dimension of each solvable nondecomposable Lie algebra of dimension less than 7. To do it, we apply an algorithmic method which goes ruling out non-valid maximal ...
An algorithm to compute abelian subalgebras in linear algebras of upper-triangular matrices [Article]
(American Institute of Physics, 2009)
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 ...