GBNP

computing Gröbner bases of noncommutative polynomials

Version 1.0.5
Released 2022-03-09

This project is maintained by The GAP Team

Build Status Code Coverage

The GAP 4 package ‘GBNP’

Summary

We provide algorithms, written in the GAP 4 programming language, for computing Grobner bases of non-commutative polynomials with coefficients from a field implemented in GAP, and some variations, such as a weighted and truncated version and a tracing facility.

The word algorithm is interpreted loosely: in general one cannot expect such an algorithm to terminate, as it would imply solvability of the word problem for finitely presented (semi)groups.

Distribution

The ‘GBNP’ package is Copyright The GAP Group, 2001-2020.

‘GBNP’ is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.

For details, see https://www.gnu.org/licenses/gpl.html

Installation

Acknowledgments:

Authors:

Contact

If you have a question relating to ‘GBNP’ or encounter any problems, please report an issue on the GitHub issue tracker at: https://github.com/gap-packages/gbnp/issues/new