I - Groebner basis computation
Here are some theoretical data gathered from [1]:
An ideal V is the set of all polynomials g*f, g = any polynomial, f belonging to a family F of generator polynomials.
We consider the polynomials in the indeterminates x1,x2,...,xn. Let < be an ordering over the monomials that satisfies to the following conditions:
a) if a < b, then for every monomial c, we have ac < bc
b) for every monomials a and b with b!=1, we have a < ab
The lexicographical ordering satisfies to these conditions. It is defined as:
x1^a1*x2^a2*...*xn^an < x1^b1*x2^b2*...*xn^bn
if:
aj = bj for j