Home Online Manual
Back: minAssChar
Forward: testPrimary
FastBack: pointid_lib
FastForward: primdecint_lib
Up: primdec_lib
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

D.4.20.9 minAssCharE

Procedure from library primdec.lib (see primdec_lib).

minAssCharE(I[,c]); i ideal, c int (optional).

list, the minimal associated prime ideals of I. If I is the unit ideal returns an empty list.

If c=0, the given ordering of the variables is used.
Otherwise, the system tries to find an optimal ordering, which in some cases may considerably speed up the algorithm.
For local orderings, the result is considered in the localization of the polynomial ring, not in the power series ring
For local and mixed orderings, the decomposition in the corresponding global ring is returned if the string 'global' is specified as third argument

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 = minAssCharE(I);
==> [1]:
==>    _[1]=z2-y
==>    _[2]=yz+2
==>    _[3]=y2+2z
==> [2]:
==>    _[1]=y+1
==>    _[2]=z2+1
ideal J = 5;
list prempty = minAssCharE(J);
==> empty list