computing Gröbner bases of noncommutative polynomials

Version 1.0.5
Released 2022-03-09

This project is maintained by The GAP Team

GAP Package GBNP

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.

The current version of this package is version 1.0.5, released on 2022-03-09. For more information, please refer to the package manual. There is also a README file.


This package requires GAP version >=4.8

The following other GAP packages are needed:


A.M. Cohen, J.W. Knopper.


Please, cite this package as

[CKT22] Cohen, A., Knopper, J. and GAP Team, T., GBNP, computing Gröbner bases of noncommutative polynomials, Version 1.0.5 (2022)
(Refereed GAP package),

You can get more info by typing Cite("GBNP"); in the gap prompt.


For bug reports, feature requests and suggestions, please use the issue tracker.