Search

In this paper, we present an algorithmic method to describe and classify filiform Lie algebras by considering the maximal dimension of abelian ideals and studying the relation between them and some known invariants of filiform Lie algebras. To do so, we have proved some new results about structure coefficients in the general law of filiform Lie algebras. Moreover, some mistakes are corrected in the already-known classification of filiform Lie algebras of dimension 8.

In this paper, we study how two important ideals of a given Lie algebra $$\mathfrak {g}$$ (namely, the center $$Z(\mathfrak {g})$$ and the derived Lie algebra $$\mathcal {D}(\mathfrak {g})$$ ) can be translated into the language of Graph Theory. In this way, we obtain some criteria and characterizations of these ideals using Graph Theory.

This paper deals with the maximal abelian dimension of a Lie algebra, that is, the maximal value for the dimensions of its abelian Lie subalgebras. Indeed, we compute the maximal abelian dimension for every nilpotent Lie algebra of dimension less than 7 and for the Heisenberg algebra $\mathfrak{H}_k$ , with $k\in\mathbb{N}$ . In this way, an algorithmic procedure is introduced and applied to compute the maximal abelian dimension for any arbitrary nilpotent Lie algebra with an arbitrary dimension. The maximal abelian dimension is also given for some general families of nilpotent Lie algebras.

This paper describes an algorithm to compute the law of the Lie algebra \(\mathfrak{g}_{n}\) associated with the Lie group Gn, formed of all the n×n upper-unitriangular matrices. The goal of this paper is to show the algorithm that computes the law of \(\mathfrak{g}_{n}\) and its implementation using the symbolic computation package MAPLE. In addition, the complexity of the algorithm is described.

In this paper, the maximal abelian dimension is computationally obtained for an arbitrary finite-dimensional Lie algebra, defined by its nonzero brackets. More concretely, we describe and implement an algorithm which computes such a dimension by running it in the symbolic computation package MAPLE. Finally, we also show a computational study related to this implementation, regarding both the computing time and the memory used.

We compute the largest dimension of the Abelian Lie subalgebras contained in the Lie algebra % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9qqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-bc8NnaaBaaaleaa% tCvAUfKttLearCqr1ngBPrgaiyGacqGFUbGBaeqaaaaa!4900! $$\mathfrak{g}_n $$ of n×n strictly upper triangular matrices, where n ∈ ℕ \ {1}. We do this by proving a conjecture, which we previously advanced, about this dimension. We introduce an algorithm and use it first to study the two simplest particular cases and then to study the general case.