D.4.7.4 minAssGTZ

Procedure from library primdec.lib (see primdec_lib).

Usage:

minAssGTZ(i); i ideal
minAssGTZ(i,1); i ideal does not use the factorizing Groebner

Return:

a list, the minimal associated prime ideals of i.

Note:

Designed for characteristic 0, works also in char k > 0 based on an algorithm of Yokoyama

Example:

LIB "primdec.lib";
ring  r = 0,(x,y,z),dp;
poly  p = z2+1;
poly  q = z3+2;
ideal i = p*q^2,y-z2;
list pr = minAssGTZ(i);
pr;
→ [1]:
→    _[1]=z2+1
→    _[2]=-z2+y
→ [2]:
→    _[1]=z3+2
→    _[2]=-z2+y