up previous next
saturation of ideals
This functions returns the saturation of I with respect to J: the
ideal of polynomials F such that F*G is in I for all G in J^d
for some positive integer d
It calculates the saturation using a Hilbert-driven algorithm.
It differs from
only when the
input is inhomogeneous, in which case, HSaturation
may be faster.
The coefficient ring must be a field.
Use R ::= QQ[x,y];
I := Ideal(x^4-x, yx-2x);