4ti2 tutorial
Input Auxiliary functions Output management
Hilbert bases Graver bases Gröbner bases Markov bases Minimization
'groebner' computes Gröbner bases of graded lattice ideals of lattices L given
as ker(A) for given matrix A
or
by lattice generators.

Returned is a degrevlex Gröbner basis with x[1]<...<x[n], unless cost vector is specified.

Gröbner basis from matrix

If present, lattice generators will be read automatically from "fileName.lat".

If present, cost vector will be read automatically from "fileName.cost".

./groebner fileName
The new 'groebner' is far more flexible than the one in version 1.1. You may call it also via:

./groebner [option] fileName

With no option set, 'groebner' behaves as in version 1.1. However, the new project-and-lift algorithm is used for the computation. For more details, please wait for the full release at the end of August 2005.

As options are possible:

--groebner Compute a Groebner basis.
--saturation Use the Saturation algorithm.
--project-and-lift Use the Project-and-Lift algorithm.
--normal Use the straight-forward completion procedure.
--graded Use the graded completion procedure.
--gebauer-moeller Use the Gebauer and Moeller criteria.
--auto-reduce-freq=n Set the frequency of auto reduction to 'n' iterations.

--silent Surpresses all output.
back to www.4ti2.de