Computing Levi decompositions in Lie algebras

DOI10.1007/s002000050066zbMath0885.17001OpenAlexW1992530404WikidataQ115389029 ScholiaQ115389029MaRDI QIDQ1361007

Gábor Ivanyos, Alex Küronya, Lajos Rónyai, Willem A. De Graaf

Publication date: 5 April 1998

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000050066

zbMATH Keywords

complexitysemisimple Lie algebrasradicalpolynomial time algorithmsassociative algebrasstructure constantsLevi decompositionWedderburn-Malcev decomposition

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Structure theory for Lie algebras and superalgebras (17B05) Computational aspects of associative rings (general theory) (16Z05) Computational methods for problems pertaining to nonassociative rings and algebras (17-08)

Related Items (6)

Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing ⋮ Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\) ⋮ Noncommutative polynomials describing convex sets ⋮ Explicit isomorphisms of quaternion algebras over quadratic global fields ⋮ Using Cartan subalgebras to calculate nilradicals and Levi subalgebras of Lie algebras ⋮ Noncommutativity makes determinants hard

Uses Software

• CANONIK

This page was built for publication: Computing Levi decompositions in Lie algebras