Buscar
Mostrando ítems 1-5 de 5
Ponencia
Combinatorial structures of three vertices and Lie algebras
(Computational and Mathematical Methods in Science and Engineering, 2011)
In this paper, we characterize digraphs of 3 vertices associated with Lie algebras according to isomorphism classes of these associated Lie algebras. At this respect, we introduce and implement two algorithmic methods: the ...
Artículo
Computing abelian subalgebras for linear algebras of upper-triangular matrices from an algorithmic perspective
(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 ...
Artículo
Computational algorithm for obtaining Abelian subalgebras in Lie algebras
(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 ...
Ponencia
Obtaining combinatorial structures associated with low-dimensional Leibniz algebras
(2013)
In this paper, we analyze the relation between Leibniz algebras and combinatorial structures. More concretely, we study the properties to be satisfied by (pseudo)digraphs so that they are associated with low-dimensional ...
Ponencia
Computational method for obtaining filiform Lie algebras of arbitrary dimension
(WSEAS Press, 2011-09)
This paper shows a new computational method to obtain filiform Lie algebras, which is based on the relation between some known invariants of these algebras and the maximal dimension of their abelian ideals. Using this ...