Changeset 50cbdc in git for Singular/LIB/primdec.lib

Timestamp:

Aug 27, 2001, 4:48:02 PM (23 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

2567b5a6cb7109be5a83e53eb94abb1c38fb9945

Parents:

3de58c9ca0aeaafdf5cb29f986967bffa405b542

Message:

*hannes: merge-2-0-2


git-svn-id: file:///usr/local/Singular/svn/trunk@5619 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• Singular/LIB/primdec.lib (modified) (7 diffs)

Singular/LIB/primdec.lib

@@ -1 +1 @@
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: primdec.lib,v 1.99 2001-03-29 11:34:59 Singular Exp $";
+version="$Id: primdec.lib,v 1.100 2001-08-27 14:47:58 Singular Exp $";
 category="Commutative Algebra";
 info="
@@ -379 +379 @@
 ///////////////////////////////////////////////////////////////////////////////
 
-static proc idealsEqual( ideal k, ideal j)
+proc idealsEqual( ideal k, ideal j)
 {
    return(stdIdealsEqual(std(k),std(j)));
@@ -426 +426 @@
 
 
-static proc primaryTest (ideal i, poly p)
+proc primaryTest (ideal i, poly p)
 {
    int m=1;
@@ -797 +797 @@
     for(i=1;i<=size(keep);i++)
     {
-       l[size(l)+1]=keep[i];
-       l[size(l)+1]=primaryTest(keep[i],keep[i][1]);
+       if(deg(keep[i][1])>0)
+       {
+          l[size(l)+1]=keep[i];
+          l[size(l)+1]=primaryTest(keep[i],keep[i][1]);
+       }
     }
   }
@@ -952 +955 @@
      }
   }
+
   if(size(#)==0)
   {
@@ -3156 +3160 @@
 RETURN:  ideal, the radical of i.
 NOTE:    Uses the algorithm of Eisenbud/Huneke/Vasconcelos, which
-         reduces the computation to the complete intersection case, 
+         reduces the computation to the complete intersection case,
          by taking, in the general case, a generic linear combination
          of the input.
@@ -3177 +3181 @@
    intvec op=option(get);
    matrix M;
-   
+
    option(redSB);
    list m=mstd(i);