polygb2
http://www.win.tue.nl/~amc/oz/om/cds/polygb2.ocd
2006-06-01
2004-06-01
experimental
1
1
This CD contains operators for Groebner basis computations with
polynomial expressions. It adds features to polygb1 like testing
membership of an ideal, and of the radical ideal of an ideal, and
providing insight as to how to change the ideal minimally so as to let
this happen. Suggestion:
polygb3 is to contain a trace of the GB computation.
polygb4 is to contain S poly
in
This symbol is a function of at least 4 arguments. The first argument
is a polynomial p,
the second is a list of variables, the third is an ordering
the fourth is a list of polynomials B, and,
optionally, the fifth is a polynomial_ring.
When applied to its arguments, it represents the boolean value
of the assertion that p belongs to the ideal generated by B.
2
1
2
1
in_radical
This symbol is a function of at least 4 arguments. The first argument
should be a polynomial p,
the second is a list of variables, the third is an ordering
the fourth is a list of polynomials B, and
optionally: the fifth is a polynomial_ring.
When applied to its arguments, it represents the boolean value
of the assertion that p belongs to the radical ideal generated by B.
The following evaluates to true:
2
1
2
2
1
The following evaluates to false:
-1
3
1
3
minimal_groebner_element
This symbol is a function with 3 arguments. First argument is
a list of variables, the second is an ordering, the third is a list B
of polynomials.
[Optionally, the fourth is a polynomial ring.]
When applied to its arguments, it represents the polynomial in
the Groebner basis of B with respect to the ordering with the
least leading monomial.
The following evaluates to the polynomial 1-2y^3+y^6 (up to a scalar multiple)
2
1
2
2
1
extended_in
This symbol is a function of at least 3 arguments. The first argument is a list of variables.
The second and third argument are lists of polynomials in the variables from the first
argument, C and T respectively.
When applied to its arguments, it represents the boolean value of the assertion that all elements t
in T can be written as t = f_1*c_1 + ... + f_n*c_n (c_i in C).
If the optional 4th argument is 1, those f_i are returned.
2
1