Lie Algebras and Superalgebras Defined by a Finite Number of Relations: Computer Analysis
From MaRDI portal
Publication:4941730
Recommendations
- Construction of finitely presented Lie algebras and superalgebras
- An implementation in \(\mathbf C\) of an algorithm for construction of finitely presented Lie superalgebras
- scientific article; zbMATH DE number 1375565
- A complex of algorithms for computations in Lie superalgebras
- Program for constructing a complete system of relations, basis elements, and commutator table for finitely presented Lie algebras and superalgebras
Cited in
(14)- The construction of finitely represented Lie algebras
- Termination for a class of algorithms for constructing algebras given by generators and relations
- An implementation in \(\mathbf C\) of an algorithm for construction of finitely presented Lie superalgebras
- Test for Leibniz n-algebra structure
- Computing covers of Lie algebras
- scientific article; zbMATH DE number 1375565 (Why is no real title available?)
- FPLSA
- scientific article; zbMATH DE number 524279 (Why is no real title available?)
- Gröbner-Shirshov bases and their calculation
- A complex of algorithms for computations in Lie superalgebras
- Program for constructing a complete system of relations, basis elements, and commutator table for finitely presented Lie algebras and superalgebras
- Realization of Lie algebras and superalgebras in terms of creation and annihilation operators. I
- Nonhomogeneous subalgebras of Lie and special Jordan superalgebras
- An algorithm for the construction of matrix representations for finitely presented non-commutative algebras
This page was built for publication: Lie Algebras and Superalgebras Defined by a Finite Number of Relations: Computer Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941730)