Termination for a class of algorithms for constructing algebras given by generators and relations

DOI10.1016/S0022-4049(97)00021-2zbMath0886.17001OpenAlexW2102736167MaRDI QIDQ1358923

Marcel Roelofs, Marc A. A. van Leeuwen

Publication date: 26 April 1998

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-4049(97)00021-2

zbMATH Keywords

algorithmsidentitiesfree Lie algebramultiplication tablesstructure constantsfree nonassociative algebraconfluent rewrite system

Mathematics Subject Classification ID

Identities, free Lie (super)algebras (17B01) Computational methods for problems pertaining to nonassociative rings and algebras (17-08) Free nonassociative algebras (17A50) General theory of nonassociative rings and algebras (17A01)

Related Items (1)

Non-associative Gröbner bases, finitely-presented Lie rings and the Engel condition. II

Uses Software

• LIESUPER

Cites Work

• Unnamed Item
• Lie algebra computations
• An algorithm for the construction of matrix representations for finitely presented non-commutative algebras
• Constructing matrix representations of finitely presented groups
• On vector enumeration
• Program for constructing a complete system of relations, basis elements, and commutator table for finitely presented Lie algebras and superalgebras

This page was built for publication: Termination for a class of algorithms for constructing algebras given by generators and relations