The constructor for a Groebner basis (reduced, minimal). The first is a list of
variables, the second argument is an ordering, the third is the Groebner Basis itself
(with respect to the ordering) that should be represented as a polynomial expression.
The groebner basis (reduced, minimal) of a set of polynomials, with
respect to a given ordering. First argument is a list of
variables, the second is an ordering, the
third is a list of polynomials. A program that can compute
the basis is required to return a "groebner_basis" object.
The constructor for a Groebner basis (reduced, minimal). The first
argument is an ordering, the second is the Groebner Basis itself
(with respect to the ordering) that should be represented as a DMPL.
This attribute, attached to a groebnered object, says 'true' if
the base is fully reduced, i.e. no monomial is divisible by the
leading monomial of any other polynomial.
The reduction of a polynomial with respect to a list P of
polynomials. First argument is a polynomial expression p, the
second argument is the list P of polynomials, the third argument
is a list of variables, the fourth argument is a monomial
reduction ordering. A program implementing this operation
should return a polynomial which represents a polynomial
reduced from p with respect to P. This means
that p is expressible as the sum of the
returned polynomial and a linear combination of the
polynomials from P with coefficients being polynomials
in the variables given in the third argument, and that no
monomial of the returned polynomial is divisible by the
leading monomial of an element from P.
