A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
An algorithm for analysis of the structure of finitely presented Lie algebras
1997
Discrete Mathematics & Theoretical Computer Science
International audience 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
doi:10.46298/dmtcs.243
fatcat:4hboqy3axvbwllbinbowcelmla