Changeset 80a2d8 in git

Timestamp:

Jan 9, 2023, 4:19:16 PM (16 months ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

69eed9010f45a15ad5528d8b504425ac16cf2743

Parents:

5fd36466ec90af62d5a73de9b58addcf5cc9db70

Message:

checks coeffs: must be ZZ in primdecint.lib

File:

• Singular/LIB/primdecint.lib (modified) (10 diffs)

Singular/LIB/primdecint.lib

@@ -15 +15 @@
   polynomial ring over the integers, Z[x_1,...,x_n].
   The first procedure 'primdecZ' can be used in parallel.
+  The coefficients must always be ZZ.
 
   Reference: Pfister,   Sadiq, Steidel , \"An Algorithm for primary decomposition in polynomial rings over the integers\" , arXiv:1008.2074
@@ -39 +40 @@
 "USAGE:  primdecZ(I[, n]); I ideal, n integer (number of processors)
 NOTE:    If size(#) > 0, then #[1] is the number of available processors for
-         the computation.
+         the computation.@*
+         The coefficients must be ZZ.
 RETURN:  a list pr of primary ideals and their associated primes:
 @format
@@ -48 +50 @@
 "
 {
+   if (coeffs(basering)!=ZZ) { ERROR("coefficoents must be ZZ"); }
    if(size(I)==0){return(list(list(ideal(0),ideal(0))));}
 
@@ -400 +403 @@
 proc minAssZ(ideal I)
 "USAGE:  minAssZ(I); I ideal
+         The coefficients must be ZZ.
 RETURN:  a list pr of associated primes:
 EXAMPLE: example minAssZ; shows an example
 "
 {
+   if (coeffs(basering)!=ZZ) { ERROR("coefficoents must be ZZ"); }
    if(size(I)==0){return(list(ideal(0)));}
    if(deg(I[1])==0)
@@ -537 +542 @@
 proc heightZ(ideal I)
 "USAGE:  heightZ(I); I ideal
+         The coefficients must be ZZ.
 RETURN:  the height of the input ideal
 EXAMPLE: example heightZ; shows an example
 "
 {
+   if (coeffs(basering)!=ZZ) { ERROR("coefficoents must be ZZ"); }
    if(size(I)==0){return(0);}
    if(deg(I[1])==0)
@@ -630 +637 @@
 proc radicalZ(ideal I)
 "USAGE:  radicalZ(I); I ideal
+         The coefficients must be ZZ.
 RETURN:  the radcal of the input ideal
 EXAMPLE: example radicalZ; shows an example
 "
 {
+   if (coeffs(basering)!=ZZ) { ERROR("coefficoents must be ZZ"); }
    if(size(I)==0){return(ideal(0));}
    if(deg(I[1])==0)
@@ -733 +742 @@
 proc equidimZ(ideal I)
 "USAGE:  equidimZ(I); I ideal
+         The coefficients must be ZZ.
 RETURN:  the part of minimal height
 EXAMPLE: example equidimZ; shows an example
 "
 {
+   if (coeffs(basering)!=ZZ) { ERROR("coefficoents must be ZZ"); }
    if(size(I)==0){return(ideal(0));}
    if(deg(I[1])==0)
@@ -914 +925 @@
 proc intersectZ(ideal I, ideal J)
 "USAGE:  intersectZ(I,J); I,J ideals
+         The coefficients must be ZZ.
 RETURN:  the intersection of the input ideals
 NOTE:    this is an alternative to intersect(I,J) over integers,
@@ -919 +931 @@
 EXAMPLE: example intersectZ; shows an example
 {
+   if (coeffs(basering)!=ZZ) { ERROR("coefficoents must be ZZ"); }
    def R = basering;
    ring S=integer,( X(1..nvars(R)) ), ( dp(nvars(R)) );
@@ -1501 +1514 @@
 proc primdecZM(module N)
 "USAGE:  primdecZM(N); N module
+         The coefficients must be ZZ.
 RETURN:  a list pr of primary modules and their associated primes:
 @format