Algorithm to compute abelian subalgebras and ideals in Malcev algebras

DOI10.1002/mma.3940zbMath1418.17072OpenAlexW2464615950MaRDI QIDQ2831034

Juan Núñez Valdés, Angel Francisco Tenorio Villalón, Manuel Ceballos

Publication date: 1 November 2016

Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/mma.3940

zbMATH Keywords

algorithmabelian subalgebraMalcev algebraabelian ideal\(\beta\) invariant\(\alpha\) invariant

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Mal'tsev rings and algebras (17D10) Software, source code, etc. for problems pertaining to nonassociative rings and algebras (17-04)

Uses Software

• Maple

Cites Work

• New results in the classification of filiform Lie algebras
• The maximal abelian dimension of linear algebras formed by strictly upper triangular matrices
• Algorithmic procedure to compute abelian subalgebras and ideals of maximal dimension of Leibniz algebras
• Algorithmic method to obtain abelian subalgebras and ideals in Lie algebras

This page was built for publication: Algorithm to compute abelian subalgebras and ideals in Malcev algebras