Computing Levi decompositions in Lie algebras

W.A. Graaf, de; G. Ivanyos; A. Küronya; L. Ronyai

doi:10.1007/s002000050066

Computing Levi decompositions in Lie algebras

W.A. Graaf, de
, G. Ivanyos
, A. Küronya
, L. Ronyai

Research output: Contribution to journal › Article › Academic › peer-review

12 Citations (Scopus)

Abstract

We consider the algorithmic problem of computing Levi decompositions in Lie algebras and Wedderburn–Malcev decompositions in associative algebras over the field of rational numbers. We propose deterministic polynomial time algorithms for both problems. The methods are based on the corresponding classical existence theorems. Computational experiences are discussed at the end of the paper.

Original language	English
Pages (from-to)	291-303
Number of pages	13
Journal	Applicable Algebra in Engineering, Communication and Computing
Volume	8
Issue number	4
DOIs	https://doi.org/10.1007/s002000050066
Publication status	Published - 1997

Access to Document

10.1007/s002000050066

Cite this

@article{55de09389e0e4a66bd9be74010d2970b,

title = "Computing Levi decompositions in Lie algebras",

abstract = "We consider the algorithmic problem of computing Levi decompositions in Lie algebras and Wedderburn{\textendash}Malcev decompositions in associative algebras over the field of rational numbers. We propose deterministic polynomial time algorithms for both problems. The methods are based on the corresponding classical existence theorems. Computational experiences are discussed at the end of the paper.",

author = "\{Graaf, de\}, W.A. and G. Ivanyos and A. K{\"u}ronya and L. Ronyai",

year = "1997",

doi = "10.1007/s002000050066",

language = "English",

volume = "8",

pages = "291--303",

journal = "Applicable Algebra in Engineering, Communication and Computing",

issn = "0938-1279",

publisher = "Springer",

number = "4",

}

TY - JOUR

T1 - Computing Levi decompositions in Lie algebras

AU - Graaf, de, W.A.

AU - Ivanyos, G.

AU - Küronya, A.

AU - Ronyai, L.

PY - 1997

Y1 - 1997

N2 - We consider the algorithmic problem of computing Levi decompositions in Lie algebras and Wedderburn–Malcev decompositions in associative algebras over the field of rational numbers. We propose deterministic polynomial time algorithms for both problems. The methods are based on the corresponding classical existence theorems. Computational experiences are discussed at the end of the paper.

AB - We consider the algorithmic problem of computing Levi decompositions in Lie algebras and Wedderburn–Malcev decompositions in associative algebras over the field of rational numbers. We propose deterministic polynomial time algorithms for both problems. The methods are based on the corresponding classical existence theorems. Computational experiences are discussed at the end of the paper.

U2 - 10.1007/s002000050066

DO - 10.1007/s002000050066

M3 - Article

SN - 0938-1279

VL - 8

SP - 291

EP - 303

JO - Applicable Algebra in Engineering, Communication and Computing

JF - Applicable Algebra in Engineering, Communication and Computing

IS - 4

ER -

Computing Levi decompositions in Lie algebras

Abstract

Access to Document

Fingerprint

Cite this