GAP

Main Branches

Downloads  Installation  Overview  Data Libraries  Packages  Documentation  Contacts  FAQ  GAP 3 

GAP package GBNP

computing Gröbner bases of noncommutative polynomials

The GBNP package provides algorithms for computing Grobner bases of noncommutative polynomials with coefficients from a field implemented in GAP and with respect to the "total degree first then lexicographical" ordering. Further provided are some variations, such as a weighted and truncated version and a tracing facility. The word "algorithm" is to be interpreted loosely here: in general one cannot expect such an algorithm to terminate, as it would imply solvability of the word problem for finitely presented (semi)groups.

Authors
A.M. Cohen, J.W. Knopper
Maintainers
A.M. Cohen, J.W. Knopper
Version with GAP 4.11.1
1.0.3    (Released 08/03/2016)
Status
accepted    (communicated by Alexander Hulpke (Fort Collins, CO), accepted 01/05/2010)
Dependencies
GAP version: >=4.4
Needed other packages: GAPDoc (>= 0.99)
Documentation
GBNP [HTML]     [PDF]
Download
GBNP-1.0.3   [.tar.gz]