Version 0.9.4
30 May 2007
Arjeh M. Cohen
e-mail: A.M.Cohen@tue.nl
Address:
TU/e,
POB 513, 5600 MB Eindhoven, the Netherlands
We provide algorithms, written in the GAP 4 programming language, for computing Gröbner bases of noncommutative polynomials, and some variations, such as a weighted and truncated version and a tracing facility. In addition, there are algorithms for analyzing the quotient of a noncommutative polynomial algebra by a 2-sided ideal generated by a set of polynomials whose Gröbner basis has been determined and for computing quotient modules of free modules over quotient algebras.
The notion of algorithm is interpreted loosely: in general one cannot expect a noncommutative Gröbner basis algorithm to terminate, as it would imply solvability of the word problem for finitely presented (semi)groups.
The package is based on an earlier version by Rosane Ushirobira.
The bulk of the package is written by Arjeh M. Cohen and Dié A.H. Gijsbers.
The theory is mainly taken from literature by Teo Mora [M] and Edward L. Green [G99].
From 0.8.3 on the package has three additional files (fincheck.g, tree.g graphs.g) with routines for finding the Hilbert function and testing finite dimensionality when given a Gröbner basis by Chris Krook [K03], based on work by Victor Ufnarovski [U89].
From 0.9 on the package is enriched with support for fields implemented in GAP and additional prefix rules for quotient modules, as well as some speed improvements by Jan Willem Knopper. The documentation system from which this text is derived is also due to him.
generated by GAPDoc2HTML