Computing Levi decompositions in Lie algebras
DOI10.1007/S002000050066zbMATH Open0885.17001OpenAlexW1992530404WikidataQ115389029 ScholiaQ115389029MaRDI QIDQ1361007FDOQ1361007
Alex Küronya, Lajos Rónyai, Gábor Ivanyos, 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
Recommendations
complexityradicalassociative algebrassemisimple Lie algebraspolynomial time algorithmsstructure constantsLevi decompositionWedderburn-Malcev decomposition
Symbolic computation and algebraic computation (68W30) Computational aspects of associative rings (general theory) (16Z05) Structure theory for Lie algebras and superalgebras (17B05) Computational methods for problems pertaining to nonassociative rings and algebras (17-08)
Cited In (10)
- Noncommutativity makes determinants hard
- Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\)
- Noncommutative polynomials describing convex sets
- Using Cartan subalgebras to calculate nilradicals and Levi subalgebras of Lie algebras
- Computing the index of Lie algebras
- On the identification of a Lie algebra given by its structure constants. I: Direct decompositions, Levi decompositions, and nilradicals
- The Levi Decomposition of a Graded Lie Algebra
- PASCAL programs for identification of Lie algebras. III: Levi decomposition and canonical basis
- Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing
- Explicit isomorphisms of quaternion algebras over quadratic global fields
Uses Software
This page was built for publication: Computing Levi decompositions in Lie algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361007)
