The commutative algorithm is described in the diploma thesis of Michael Brickenstein "Neue Varianten zur Berechnung von Groebnerbasen",
written 2004 under supervision of G.-M. Greuel in Kaiserslautern.
It is designed to keep polynomials or vectors slim (short with small coefficients).
Currently best results are examples over function fields (parameters).
The current implementation may not be optimal for weighted degree orderings.
The program only supports the options prot
, which will give protocol output and redSB
for returning a reduced Groebner basis.
The protocol messages of slimgb
mean the following:
M[n,m]
means a parallel reduction of n
elements with m
non-zero output elements,
b
notices an exchange trick described in the thesis and
e
adds a reductor with non-minimal leading term.
slimgb
works for grade commutative algebras but not for general GR-algebras.
Please use qslimgb
instead.
For a detailed commutative example see slim Groebner bases.