If I is an ideal in an affine ring (i.e. a quotient of a polynomial ring over a field), and if the characteristic of this field is large enough (see below), then this routine yields the radical of the ideal I.
The method used is the Eisenbud-Huneke-Vasconcelos algorithm. See their paper in invent. math. 1993 for more details on the algorithm.
Allowable options include
For an example, see component example.
The algorithms used generally require that the characteristic of the ground field is larger than the degree of each primary component. In practice, this means that if the characteristic is something like 32003, rather than e.g. 5, the methods used will produce the radical of I. Of course, you may do the computation over QQ, but it will often run much slower. In general, this routine still needs to be tuned for speed.
See also top, removeLowestDimension, saturate, and quotient.
Go to main index.
Go to concepts index.