An algorithm for analysis of the structure of finitely presented Lie algebras

• Main Authors: Vladimir P. Gerdt, Vladimir V. Kornyak
• Format: Article
• Language: English
• Published: Discrete Mathematics & Theoretical Computer Science 1997-12-01
• Series: Discrete Mathematics & Theoretical Computer Science
• Online Access: http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/86

We consider the following problem: what is the most general Lie algebra satisfying a given set of Lie polynomial equations? The presentation of Lie algebras by a finite set of generators and defining relations is one of the most general mathematical and algorithmic schemes of their analysis. That problem is of great practical importance, covering applications ranging from mathematical physics to combinatorial algebra. Some particular applications are constructionof prolongation algebras in the Wahlquist-Estabrook method for integrability analysis of nonlinear partial differential equations and investigation of Lie algebras arising in different physical models. The finite presentations also indicate a way to q-quantize Lie algebras. To solve this problem, one should perform a large volume of algebraic transformations which is sharply increased with growth of the number of generators and relations. For this reason, in practice one needs to use a computer algebra tool. We describe here an algorithm for constructing the basis of a finitely presented Lie algebra and its commutator table, and its implementation in the C language. Some computer results illustrating our algorithmand its actual implementation are also presented.