next | previous | forward | backward | up | top | index | toc | home

saturate(..., MinimalGenerators => ...) -- whether to compute minimal generators

Synopsis

Description

Sometimes the extra time to find the minimal generators is too large. This allows one to bypass this part of the computation.
i1 : R = ZZ/101[x_0..x_4]

o1 = R

o1 : PolynomialRing
i2 : I = truncate(8, monomialCurveIdeal(R,{1,4,5,9}));

o2 : Ideal of R
i3 : time gens gb I;
     -- used 0.188012 seconds

             1       428
o3 : Matrix R  <--- R
i4 : time J1 = saturate(I);
     -- used 0.436027 seconds

o4 : Ideal of R
i5 : time J = saturate(I, MinimalGenerators=>false);
     -- used 0.508032 seconds

o5 : Ideal of R
i6 : numgens J

o6 = 1002
i7 : numgens J1

o7 = 7

Further information

Caveat

Most of the time, you don't want to do this!

See also