Name
Title | ||
|---|---|---|
Algorithmic procedure to compute abelian subalgebras and ideals of maximal dimension of Leibniz algebras |
Abstract | ||
|---|---|---|
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 <inline-formula><inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink=\"gcom_a_884216_ilm0001.gif\"/</inline-formula>. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1080/00207160.2014.884216 | International Journal of Computer Mathematics - New Computational and Statistical models in Science and Economics |
Keywords | Field | DocType |
algorithm | Abelian group,Elementary abelian group,Algebra,Mathematical analysis,Pure mathematics,Leibniz algebra,Rank of an abelian group,Mathematics,Computation | Journal |
Volume | Issue | ISSN |
92 | 9 | 0020-7160 |
Citations | PageRank | References |
1 | 0.35 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manuel Ceballos | 1 | 13 | 5.17 |
| Juan Nunez | 2 | 12 | 3.98 |
| Angel F. Tenorio | 3 | 13 | 4.82 |