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...

Even if it has been less than a decade and a half since Tian introduced his concept of evolution algebras to represent algebraically non-Mendelian rules in Genetics, their study is becoming increasingly widespread mainly due to their applications to many scientific disciplines. In order to facilitate further research on the topic, this paper deals with the past and present research on these kind of algebras, together with the most relevant topics regarding them Junta de Andalucía FQM-016

This paper studies the link between isomorphic digraphs and isomorphic Leibniz algebras, determining in detail this fact when using (psuedo)digraphs of 2 and 3 vertices associated with Leibniz algebras according to their isomorphism classes. Moreover, we give the complete list with all the combinatorial structures of 3 vertices associated with Leibniz algebras, studying their isomorphism classes. We also compare our results with the current classifications of 2- and 3-dimensional Leibniz algebras. Finally, we introduce and implement the algorithmic procedure used for our goals and devoted to decide

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.

In this paper, we introduce an algorithmic procedure that computes abelian subalgebras and ideals of a given finite-dimensional Malcev algebra. All the computations are performed by using the non-zero brackets in the law of the algebra as input. Additionally, the algorithm also computes the α and β invariants of these algebras, and as a supporting output, a list of abelian ideals and subalgebras of maximal dimension is returned too. To implement this algorithm, we have used the symbolic computation package MAPLE 12, performing a brief computational and statistical study for it and its implementation. Copyright © 2016 John Wiley & Sons, Ltd.

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 of hn besides programming its implementation with the symbolic computation package MAPLE. The algorithm returns a maximal abelian subalgebra of hn and, hence, its maximal abelian dimension. The order n of the matrices hn 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.

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.

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.

In this paper, we revise some ideas on Graph Theory and develop them to explain and determine three usual concepts of Input–Output Analysis: fundamental products, autonomous sets, and indecomposable matrices. Firstly, we define a digraph associated with the given economic system (i.e., with its technical coefficients matrix). Secondly, we consider topological properties of this graph to study the economical concepts previously mentioned. Thirdly, we describe different, original algorithms to make the calculations easier. Finally, we give an example from a real economy, Andalusia (a region in Spain). Along this paper, we also discuss the advantages of this new approach and present some ideas to ease its application in the future research.

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.

This paper is devoted to study and compare two algebraic algorithms related to the computation of Lie algebras by using statistical techniques. These techniques allow us to decide which of them is more suitable and less costly depending on several variables, like the dimension of the considered algebra.

In this paper, we study the structure and properties of those n -dimensional Lie algebras associated with either summed structures of complete graphs or some families of digraphs, having into consideration that all these combinatorial structures are made up of n vertices. Our main goal is to obtain criteria determining when a Lie algebra is associated with some of combinatorial structures considered in this paper, as well as to study the properties of those structures in order to use them as a tool for classifying the types of Lie algebras associated with them.

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.

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.

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 shows an algorithm which computes the law of the Lie algebra associated with the complex Lie group of n × n upper-triangular matrices with exponential elements in their main diagonal. For its implementation two procedures are used, respectively, to define a basis of the Lie algebra and the nonzero brackets in its law with respect to that basis. These brackets constitute the final output of the algorithm, whose unique input is the matrix order n. Besides, its complexity is proved to be polynomial and some complementary computational data relative to its implementation are also shown.

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.

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.

En este artículo se presenta una visión global de lo que se entiende por WebQuest y se comentan varias de las existentes en Internet relativas al bloque de contenidos de Geometría y que están en castellano. Para ello, se realiza un estudio a fondo de las mismas, indicando aquellos aspectos que pueden considerarse favorables y los que podrían mejorarse.

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.

This paper deals with the problem of locating the minimal number of parking areas being necessary for dangerous goods in the European Road Transport Network. To obtain a near-optimal solution for this problem, we introduce the design of a new graph-based algorithm to locate parking areas in such a way that drivers can obey the regulations related to driving and resting times. This restriction is imposed to the problem as follows: each point in the European Road Transport Network has to be at a distance lower than 200 km from a parking area in the Network.

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.

In this paper, we compute minimal faithful unitriangular matrix representations of filiform Lie algebras. To do it, we use the nilpotent Lie algebra, gn, formed of n×n strictly upper-triangular matrices. More concretely, we search the lowest natural number n such that the Lie algebra gn contains a given filiform Lie algebra, also computing a representative of this algebra. All the computations in this paper have been done using MAPLE 9.5.

This paper deals with the maximal abelian dimension of the Lie algebra hn, of n×n upper‐triangular matrices. Regarding this, we obtain an algorithm which computes abelian subalgebras of hn as well as its implementation (and a computational study) by using the symbolic computation package MAPLE, where the order n of the matrices in hn is the unique input needed. Let us note that the algorithm also allows us to obtain a maximal abelian subalgebra of hn.

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.

The main goal of this paper is to compute a minimal matrix representation for each non-isomorphic nilpotent Lie algebra of dimension less than $6$. Indeed, for each of these algebras, we search the natural number $n\in\mathsf{N}\setminus\{1\}$ such that the linear algebra $\mathfrak{g}_n$, formed by all the $n \times n$ complex strictly upper-triangular matrices, contains a representation of this algebra. Besides, we show an algorithmic procedure which computes such a minimal representation by using the Lie algebras $\mathfrak{g}_n$. In this way, a classification of such algebras according to the dimension of their minimal matrix representations is obtained. In this way, we improve some results by Burde related to the value of the minimal dimension of the matrix representations for nilpotent Lie algebras.