up previous next
radical of an ideal
radical(N: INT): INT
radical(X: RINGELEM): RINGELEM
radical(I: IDEAL): IDEAL 
This function computes the radical of its argument. For integers and
ring elements this means the product of the distinct irreducibles
dividing the argument (sometimes called "squarefree").
For ideals it computes the radical ideal using the algorithm described
in the paper
M. Caboara, P. Conti and C. Traverso:
Yet Another Ideal
Decomposition Algorithm. Proc. AAECC12, pp 3954, 1997, Lecture
Notes in Computer Science, n.1255 SpringerVerlag.
NOTE: at the moment, this implementation works only if the coefficient
ring is the rationals or has large enough characteristic.
/**/ radical(99);
33
/**/ use R ::= QQ[x,y];
/**/ radical((x y)^3 * (x +y));
x^2 y^2
/**/ I := ideal(x,y)^3;
/**/ radical(I);
ideal(y, x)
