CEBALLOS GONZÁLEZ, MANUEL, NÚÑEZ VALDÉS, JUAN , TENORIO VILLALÓN, ÁNGEL FRANCISCO

No

Analele Stiint. Univ. Ovidius C.

Article

Científica

4

3

0.422

0.348

01/01/2016

000386929100009

10.1515/auom-2016-0032

In this paper, the maximal abelian dimension is algorithmically and computationally studied for the Lie algebra h(n), of nxn upper -triangular matrices. More concretely, we define an algorithm to compute abelian subalgebras of h(n), besides programming its implementation with the symbolic computation package MAPLE. The algorithm returns a maximal abelian subalgebra of h(n), and, hence, its maximal abelian dimension. The order n of the matrices h(n) 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.

Maximal abelian dimension; solvable Lie algebra; algorithm

• MANUEL CEBALLOS GONZÁLEZ