Changeset 8851c2 in git

Timestamp:

Nov 20, 2003, 5:53:59 PM (20 years ago)

Author:

Mathias Schulze <mschulze@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

e64f7f773d9285c42692d4556c1bb026fffb6835

Parents:

d4cbc201ea2f57168e3d65b73d658923f16feb42

Message:

*mschulze: bug corrected


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

File:

• Singular/LIB/gmspoly.lib (modified) (4 diffs)

Singular/LIB/gmspoly.lib

@@ -1 +1 @@
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: gmspoly.lib,v 1.5 2003-06-27 10:43:44 mschulze Exp $";
+version="$Id: gmspoly.lib,v 1.6 2003-11-20 16:53:59 mschulze Exp $";
 category="Singularities";
 
@@ -13 +13 @@
 PROCEDURES:
   istame(f);  test if the polynomial f is tame
-  gbasis(f);  a good basis of the Brieskorn lattice of a tame polynomial t 
+  gbasis(f);  a good basis of the Brieskorn lattice of a cohomologically tame f
 
 SEE ALSO: gmssing_lib
@@ -29 +29 @@
 static proc mindegree(matrix A)
 {
-  int d=-1;
-
-  int i,j;
-  for(i=nrows(A);i>=1;i--)
-  {
-    for(j=ncols(A);j>=1;j--)
-    {
-      if(d==-1||(deg(A[i,j])<d&&deg(A[i,j])>-1))
-      {
-        d=deg(A[i,j]);
-      }
-    }
+  int d=0;
+
+  while(A/var(1)^(d+1)*var(1)^(d+1)==A)
+  {
+    d++;
   }
 
@@ -49 +42 @@
 static proc maxdegree(matrix A)
 {
-  int d=-1;
-
-  int i,j;
-  for(i=nrows(A);i>=1;i--)
-  {
-    for(j=ncols(A);j>=1;j--)
-    {
-      if(deg(A[i,j])>d)
-      {
-        d=deg(A[i,j]);
-      }
-    }
+  int d=0;
+  matrix N[nrows(A)][ncols(A)];
+
+  while(A/var(1)^(d+1)!=N)
+  {
+    d++;
   }