Algorithm to compute abelian subalgebras and ideals in Malcev algebras

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.