Algorithm to compute abelian subalgebras and ideals in Malcev algebras
| Autor: | Juan Núñez, Ángel F. Tenorio, Manuel Ceballos |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Pure mathematics
General Mathematics Computation 010102 general mathematics General Engineering Elementary abelian group 010103 numerical & computational mathematics 01 natural sciences Rank of an abelian group Algebra Malcev algebra Dimension (vector space) ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION 0101 mathematics Algebra over a field Abelian group Algorithm Mathematics |
| Zdroj: | Mathematical Methods in the Applied Sciences. 39:4892-4900 |
| ISSN: | 0170-4214 |
| DOI: | 10.1002/mma.3940 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text