gbnp
Compute 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.
homepage ↗ github: gap-packages/gbnp
Available in
| Overlay | Newest | Ebuilds | Last activity | |
|---|---|---|---|---|
| gentoo gitweb ↗ | 1.1.0 | 1 | 14 h | details › |
Versions & arches
Use flags of 1.1.0
- examples Install examples, usually source code
- test Enable dependencies and/or preparations necessary to run tests (usually controlled by FEATURES=test but can be toggled independently)