GBNP

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.

[WWW homepage]       [Source code repository]       [Issue tracker]

Authors

A.M. Cohen, J.W. Knopper

Maintainer

The GAP Team

Version with GAP 4.12.2

1.0.5    (Released 09/03/2022)

License

LGPL-2.1-or-later

Status

accepted    (communicated by Alexander Hulpke (Fort Collins, CO), accepted 01/05/2010)

Dependencies

GAP version: >=4.8
Needed other packages: GAPDoc (>= 1.5)

Documentation

GBNP [HTML]     [PDF]

Download

gbnp-1.0.5   [.tar.gz]