up previous next
saturation of ideals
HSaturation(I: IDEAL, J: IDEAL): IDEAL
***** NOT YET IMPLEMENTED *****
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,
may be faster.
The coefficient ring must be a field.
/**/ use R ::= QQ[x,y];
/**/ I := ideal(x^4-x, y*x-2*x);
/**/ saturate(I, ideal(x));
ideal(y -2, x^3 -1)
HSaturation(I, ideal(x)); -- ***** NOT YET IMPLEMENTED *****