Top
Back: modStd
Forward: primeList
FastBack: lll_lib
FastForward: mprimdec_lib
Up: modstd_lib
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

D.4.9.2 modS

Procedure from library modstd.lib (see modstd_lib).

Usage:
modS(I,L); I ideal, L intvec of primes
if size(#)>0 std is used instead of groebner

Return:
an ideal which is with high probability a standard basis

Note:
This procedure is designed for fast experiments.
It is not tested whether the result is a standard basis. It is not tested whether the result generates I.

Example:
 
LIB "modstd.lib";
intvec L=3,5,11,13,181;
ring r=0,(x,y,z),dp;
ideal I=3x3+x2+1,11y5+y3+2,5z4+z2+4;
ideal J=modS(I,L);
J;
==> J[1]=z2-1
==> J[2]=x3-1/2x2-1/2
==> J[3]=y5+y3-1/2


Top Back: modStd Forward: primeList FastBack: lll_lib FastForward: mprimdec_lib Up: modstd_lib Top: Singular Manual Contents: Table of Contents Index: Index About: About this document
            User manual for Singular version 3-1-1, Feb 2010, generated by texi2html.