Algorithmic procedure to compute abelian subalgebras and ideals of maximal dimension of Leibniz algebras

DOI10.1080/00207160.2014.884216zbMath1358.17001OpenAlexW2034326499WikidataQ123140211 ScholiaQ123140211MaRDI QIDQ3451398

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

Publication date: 16 November 2015

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2014.884216

zbMATH Keywords

algorithmLeibniz algebraabelian subalgebraabelian ideal\(\beta\) invariant\(\alpha\) invariant

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Leibniz algebras (17A32) Computational methods for problems pertaining to nonassociative rings and algebras (17-08)

Related Items (2)

Abelian subalgebras and ideals of maximal dimension in solvable Leibniz algebras ⋮ Algorithm to compute abelian subalgebras and ideals in Malcev algebras

Uses Software

• Maple

Cites Work

• Unnamed Item
• The classification of 4-dimensional Leibniz algebras
• On abelian subalgebras and ideals of maximal dimension in supersolvable Lie algebras
• An algorithm for the classification of 3-dimensional complex Leibniz algebras
• The maximal abelian dimension of linear algebras formed by strictly upper triangular matrices
• Abelian ideals of maximal dimension for solvable Lie algebras
• ON LEVI’S THEOREM FOR LEIBNIZ ALGEBRAS
• Algorithmic method to obtain abelian subalgebras and ideals in Lie algebras
• Classification of solvable Leibniz algebras with null-filiform nilradical

This page was built for publication: Algorithmic procedure to compute abelian subalgebras and ideals of maximal dimension of Leibniz algebras