Search

As it is well-known there exist matrix representations of any given finite-dimensional complex Lie algebra. More concretely, such representations can be obtained by means of an isomorphic matrix Li...

In this paper, we introduce an algorithmic process to associate Leibniz algebras with combinatorial structures. More concretely, we have designed an algorithm to automatize this method and to obtain the restrictions over the structure coefficients for the law of the Leibniz algebra and so determine its associated combinatorial structure. This algorithm has been implemented with the symbolic computation package Maple. Moreover, we also present another algorithm (and its implementation) to draw the combinatorial structure associated with a given Leibniz algebra, when such a structure is a (pseudo)digraph. As application of these algorithms, we have studied what (pseudo)digraphs are associated with low-dimensional Leibniz algebras by determination of the restrictions over edge weights (i.e. structure coefficients) in the corresponding combinatorial structures.

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 not specify which is the minimal order of the matrices involved in such representations. Hence, the main goal of this paper is to revisit and implement a method to compute both that minimal order and a matrix representative for a given solvable Lie algebra. As application of this procedure, we compute representatives for each solvable Lie algebra with dimension less than $6$., 19 pages, 6 tables

In this paper, we show an algorithmic procedure to compute abelian subalgebras and ideals of a given finite-dimensional Leibniz algebra, starting from the non-zero brackets in its law. In order to implement this method, the symbolic computation package MAPLE 12 is used. Moreover, we also show a brief computational study considering both the computing time and the memory used in the two main routines of the implementation. Finally, we determine the maximal dimension of abelian subalgebras and ideals for 3-dimensional Leibniz algebras and 4-dimensional solvable ones over .

This paper deals with several operations on graphs and combinatorial structures linking them with their associated Lie algebras. More concretely, our main goal is to obtain some criteria to determine when there exists a Lie algebra associated with a combinatorial structure arising from those operations. Additionally, we show an algorithmic method for one of those operations.

This paper shows a characterization of digraphs of three vertices associated with Lie algebras, as well as determining the list of isomorphism classes for Lie algebras associated with these digraphs. Additionally, we introduce and implement two algorithmic procedures related to this study: the first is devoted to draw, if exists, the digraph associated with a given Lie algebra; whereas the other corresponds to the converse problem and allows us to test if a given digraph is associated or not with a Lie algebra. Finally, we give the complete list of all non-isomorphic combinatorial structures of three vertices associated with Lie algebras and we study the type of Lie algebra associated with each configuration.

In this paper, we show an algorithmic procedure to compute abelian subalgebras and ideals of finite-dimensional Lie algebras, starting from the non-zero brackets in its law. In order to implement this method, we use the symbolic computation package MAPLE 12. Moreover, we also give a brief computational study considering both the computing time and the memory used in the two main routines of the implementation. Finally, we determine the maximal dimension of abelian subalgebras and ideals for non-decomposable solvable non-nilpotent Lie algebras of dimension 6 over both the fields ℝ and ℂ, showing the differences between these fields.

In this paper, we study the families of n-dimensional Lie algebras associated with a combinatorial structure made up of n vertices and with its edges forming a complete simple, undirected graph. Moreover, some properties are characterized for these structures using Lie theory, giving some examples and representations. Furthermore, we also study the type of Lie algebras associated with them in order to get their classification. Finally, we also show an implementation of the algorithmic method used to associate Lie algebras with complete triangular structures.

It is well-known that there exists a close link between Lie Theory and Relativity Theory. Indeed, the set of all symmetries of the metric in our four-dimensional spacetime is a Lie group. In this paper we try to study this link in depth, by dealing with three particular types of Lie algebras: h n algebras, g n algebras and Heisenberg algebras. Our main goal is to compute the maximal abelian dimensions of each of them, which will allow us to move a step forward in the advancement of this subject.

This paper is devoted to show and explain some applications of Lie Theory to solve some problems in Economics and Mathematical Finance. So we put forward and discuss mathematical aspects and approaches for several economic problems which have been previously considered in the literature. Besides we also show our advances on this topic, mentioning some open problems for future research.

Given a finite-dimensional Leibniz algebra with certain basis, we show how to associate such algebra with a combinatorial structure of dimension 2. In some particular cases, this structure can be reduced to a digraph or a pseudodigraph. In this paper, we study some theoretical properties about this association and we determine the type of Leibniz algebra associated to each of them.

Abelian subalgebras play an important role in the study of Lie algebras and their properties and structures. In this paper, the historical evolution of this concept is shown, analyzing the current status for the research on this topic. So, the main results obtained from previous years are indicated and commented here. Additionally, a list of some related open problems is also given.

In this paper, we compute minimal faithful representations of filiform Lie algebras by means of strictly upper-triangular matrices. To obtain such representations, we use nilpotent Lie algebras [Formula: see text]n, of n × n strictly upper-triangular matrices, because any given (filiform) nilpotent Lie algebra [Formula: see text] admits a Lie-algebra isomorphism with a subalgebra of [Formula: see text]n for some n ∈ ℕ\{1}. In this sense, we search for the lowest natural integer n such that the Lie algebra [Formula: see text]n contains the filiform Lie algebra [Formula: see text] as a subalgebra. Additionally, we give a representative of each representation.

This work shows how to associate the Lie algebra h n , of upper triangular matrices, with a specific combinatorial structure of dimension 2 , for n ∈ N . The properties of this structure are analyzed and characterized. Additionally, the results obtained here are applied to obtain faithful representations of solvable Lie algebras.