Computing Levi decompositions in Lie algebras (Q1361007): Difference between revisions

Polynomial time algorithms for computing a Levi decomposition of a Lie algebra over \(\mathbb{Q}\) and a Wedderburn-Malcev decomposition for an associative algebra over \(\mathbb{Q}\) or a finite field are presented. Computational experiments for two different methods are discussed. The main assumption for these algorithms is that the algebra is presented by a table of structure constants.