Computing Levi decompositions in Lie algebras (Q1361007)

From MaRDI portal
Revision as of 18:45, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing Levi decompositions in Lie algebras
scientific article

    Statements

    Computing Levi decompositions in Lie algebras (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 April 1998
    0 references
    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.
    0 references
    associative algebras
    0 references
    semisimple Lie algebras
    0 references
    radical
    0 references
    Levi decomposition
    0 references
    Wedderburn-Malcev decomposition
    0 references
    structure constants
    0 references
    complexity
    0 references
    polynomial time algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references