Changeset 120c517 in git for Singular/LIB/equising.lib

Timestamp:

Nov 8, 2005, 7:18:04 PM (18 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', 'ec94ef7a30b928574c0c3daf41f6804dff5f6b69')

Children:

b17a5c26cefea774381518da0aa52b998e0b4075

Parents:

c91fefd86fa767380ec3afd51615cf5943a61c88

Message:

*lossen: simplify


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

File:

• Singular/LIB/equising.lib (modified) (6 diffs)

Singular/LIB/equising.lib

@@ -1 @@
-version="$Id: equising.lib,v 1.13 2005-11-04 14:01:18 Singular Exp $";
+version="$Id: equising.lib,v 1.14 2005-11-08 18:18:04 Singular Exp $";
 category="Singularities";
 info="
@@ -1080 +1080 @@
     }
   }
-
-  // computation for all equimultiple sections being trivial (I^s(f))
+ 
+  // Computation for all equimultiple sections being trivial (I^s(f))
   ideal Jtriv=J;
   for (i=1;i<=no_b; i++)
@@ -1088 +1088 @@
   }
   Jtriv=std(Jtriv);
+
+
 
   dbprint(i_print,"// ");
@@ -1118 +1120 @@
     }
   }
+
+  //new CL 11/06:  check in which equations b(k) appears and remove those b(k) 
+  //               which appear in exactly one of the equations (by removing this
+  //               equation)
+  dbprint(i_print,"// ");
+  dbprint(i_print,"// Remove superfluous equations:");
+  dbprint(i_print,"// -----------------------------");
+  int Z,App_in;
+  ideal J_Tmp;
+  int ncJ=ncols(J);
+
+  intmat Mdet[ncJ][1];
+  for (Z=1;Z<=ncJ;Z++){ Mdet[Z,1]=Z; }
+
+  for (i=1;i<=no_b; i++)
+  {
+    ideal b_appears_in(i);            // Eintraege sind spaeter 1 oder 0 
+    intmat b_app_in(i)[1][ncJ];       // Eintraege sind spaeter 1 oder 0 
+    b_appears_in(i)[ncJ]=0;  
+    J_Tmp = J-subst(J,b(i),0);
+    for (Z=1; Z<=ncJ; Z++) { 
+      if (J_Tmp[Z]<>0) {      // b(i) appear in J_Tmp[Z]
+        b_appears_in(i)[Z]=1;
+        b_app_in(i)[1,Z]=1;
+      }
+    }
+    if (size(b_appears_in(i))==1) { //b(i) appears only in one J_Tmp[Z]
+      App_in = (b_app_in(i)*Mdet)[1,1];  // determines Z
+      J[App_in]=0;
+      b_appears_in(i)[App_in]=0;
+      b_app_in(i)[1,App_in]=0;
+    }
+  }
+
+  for (i=1;i<=no_b; i++)
+  {
+    if (size(b_appears_in(i))==1) { //b(i) appears only in one J_Tmp[Z]
+      App_in = (b_app_in(i)*Mdet)[1,1];  // determines Z
+      J[App_in]=0;
+      b_appears_in(i)[App_in]=0;
+      b_app_in(i)[1,Z]=1;
+      i=0;
+    }
+  }
+
 
   ideal J_no_b = nselect(J,1,no_b);
@@ -1983 +2030 @@
 option(prot);
 timer=1;
-ring r=32003,(x,y),ds;
+ring r=0,(x,y),ls;
 poly f=(x4-y4)^2-x10;
 list L=versal(f);
@@ -2020 +2067 @@
 poly f=w2-v199;
 list L=hnexpansion(f);
-List LL=versal(f);
+list LL=versal(f);
 def Px=LL[1];
 setring Px;