An Implementation in C of an Algorithm for Construction of Finitely Presented Lie Superalgebras
The purpose of this paper is to describe a C program FPLSA for investigating finitely presented Lie algebras and superalgebras. The program takes as input data a finite set of generators and relations for these elements. The relations have the form of Lie polynomials with coefficients being either i...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
1996-12-01
|
| Series: | Computer Science Journal of Moldova |
| Online Access: | http://www.math.md/nrofdownloads.php?file=/files/csjm/v4-n3/v4-n3-(pp399-427).pdf |