up previous next
intersection of ideals
HIntersection(I_1:IDEAL,...,I_n:IDEAL):IDEAL
HIntersectionList(L:LIST of IDEAL):IDEAL
|
The function
HIntersection returns the intersection of
I_1,...,I_n
using a Hilbert-driven algorithm. It differs from
Intersection
only
when the input is non-homogeneous, in which case,
HIntersection
may be faster.
The coefficient ring must be a field.
Use R ::= QQ[x,y,z];
HIntersection(Ideal(x-z,y-2z), Ideal(x-2z,y-z));
Ideal(x + y - 3z, y^2 - 3yz + 2z^2)
-------------------------------
|