===================================================================
RCS file: /home/cvs/OpenXM/src/k097/lib/minimal/minimal.k,v
retrieving revision 1.11
retrieving revision 1.17
diff -u -p -r1.11 -r1.17
--- OpenXM/src/k097/lib/minimal/minimal.k	2000/05/19 11:16:51	1.11
+++ OpenXM/src/k097/lib/minimal/minimal.k	2000/07/26 12:56:36	1.17
@@ -1,4 +1,4 @@
-/* $OpenXM: OpenXM/src/k097/lib/minimal/minimal.k,v 1.10 2000/05/07 02:10:44 takayama Exp $ */
+/* $OpenXM: OpenXM/src/k097/lib/minimal/minimal.k,v 1.16 2000/06/15 07:38:36 takayama Exp $ */
 #define DEBUG 1 
 /* #define ORDINARY 1 */
 /* If you run this program on openxm version 1.1.2 (FreeBSD),
@@ -6,7 +6,7 @@
    ln -s /usr/bin/cpp /lib/cpp
 */
 #define OFFSET 0 
-/* #define TOTAL_STRATEGY */
+#define TOTAL_STRATEGY 1
 /* #define OFFSET 20*/
 /* Test sequences. 
    Use load["minimal.k"];;
@@ -132,13 +132,25 @@ sm1(" [(AvoidTheSameRing)] pushEnv 
       [ [(AvoidTheSameRing) 0] system_variable 
         [(gbListTower) tower (list) dc] system_variable
       ] pop popEnv ");
+      /* sm1("(hoge) message show_ring "); */
 }
 
 def SresolutionFrameWithTower(g,opt) {
   local gbTower, ans, ff, count, startingGB, opts, skelton,withSkel, autof,
-        gbasis;
+        gbasis, nohomog;
+  nohomog = false;
+  count = -1;
   if (Length(Arglist) >= 2) {
-    if (IsInteger(opt)) count = opt;
+    if (IsInteger(opt)) {
+      count = opt;
+    }else if (IsString(opt)) {
+      if (opt == "homogenized") {
+         nohomog = true;
+      }else{
+         Println("Warning: unknown option");
+         Println(opt);
+      }
+    }
   }else{
     count = -1;
   }
@@ -152,7 +164,12 @@ def SresolutionFrameWithTower(g,opt) {
   */
 
   sm1(" (mmLarger) (matrix) switch_function ");
-  g = Map(g,"Shomogenize");
+  if (! nohomog) {
+    Println("Automatic homogenization.");
+    g = Map(g,"Shomogenize");
+  }else{
+    Println("No automatic homogenization.");
+  }
   if (SonAutoReduce) {
     sm1("[ (AutoReduce) ] system_variable /autof set ");
     sm1("[ (AutoReduce) 1 ] system_variable ");
@@ -192,12 +209,13 @@ def SresolutionFrameWithTower(g,opt) {
 }
 HelpAdd(["SresolutionFrameWithTower",
 ["It returs [resolution of the initial, gbTower, skelton, gbasis]",
+ "option: \"homogenized\" (no automatic homogenization) ",
  "Example: Sweyl(\"x,y\");",
  "         a=SresolutionFrameWithTower([x^3,x*y,y^3-1]);"]]);
 
 def SresolutionFrame(f,opt) {
   local ans;
-  ans = SresolutionFrameWithTower(f);
+  ans = SresolutionFrameWithTower(f,opt);
   return(ans[0]);
 }
 /* ---------------------------- */
@@ -291,7 +309,10 @@ def Sres0FrameWithSkelton(g) {
 
 
 def StotalDegree(f) {
-  sm1(" [(grade) f] gbext (universalNumber) dc /FunctionValue set ");
+  local d0;
+  sm1(" [(grade) f] gbext (universalNumber) dc /d0 set ");
+  /* Print("degree of "); Print(f); Print(" is "); Println(d0); */
+  return(d0);
 }
 
 /* Sord_w(x^2*Dx*Dy,[x,-1,Dx,1]); */
@@ -359,6 +380,10 @@ def Sdegree(f,tower,level) {
 
 def SgenerateTable(tower) {
   local height, n,i,j, ans, ans_at_each_floor;
+
+  /*
+  Print("SgenerateTable: tower=");Println(tower);  
+  sm1(" print_switch_status "); */
   height = Length(tower);
   ans = NewArray(height);
   for (i=0; i<height; i++) {
@@ -434,7 +459,7 @@ def SmaxOfStrategy(a) {
 }  
 
 
-def SlaScala(g) {
+def SlaScala(g,opt) {
   local rf, tower, reductionTable, skel, redundantTable, bases,
         strategy, maxOfStrategy, height, level, n, i,
         freeRes,place, f, reducer,pos, redundant_seq,bettiTable,freeResV,ww,
@@ -443,10 +468,17 @@ def SlaScala(g) {
   /* extern WeightOfSweyl; */
   ww = WeightOfSweyl;
   Print("WeightOfSweyl="); Println(WeightOfSweyl);
-  rf = SresolutionFrameWithTower(g);
+  rf = SresolutionFrameWithTower(g,opt);
+  Print("rf="); sm1_pmat(rf);
   redundant_seq = 1;   redundant_seq_ordinary = 1;
   tower = rf[1];
+
+  Println("Generating reduction table which gives an order of reduction.");
+  Print("WeghtOfSweyl="); Println(WeightOfSweyl);
+  Print("tower"); Println(tower);
   reductionTable = SgenerateTable(tower);
+  Print("reductionTable="); sm1_pmat(reductionTable);
+
   skel = rf[2];
   redundantTable = SnewArrayOfFormat(rf[1]);
   redundantTable_ordinary = SnewArrayOfFormat(rf[1]);
@@ -467,7 +499,7 @@ def SlaScala(g) {
         Println([level,i]);
         reductionTable_tmp[i] = -200000;
         if (reductionTable[level,i] == strategy) {
-           Print("Processing "); Print([level,i]);
+           Print("Processing [level,i]= "); Print([level,i]);
            Print("   Strategy = "); Println(strategy);
            if (level == 0) {
              if (IsNull(redundantTable[level,i])) {
@@ -535,7 +567,7 @@ def SlaScala(g) {
     bases = Sbases_to_vec(bases,bettiTable[i]);
     freeResV[i] = bases;
   }
-  return([freeResV, redundantTable,reducer,bettiTable,redundantTable_ordinary]);
+  return([freeResV, redundantTable,reducer,bettiTable,redundantTable_ordinary,rf]);
 }
 
 def SthereIs(reductionTable_tmp,strategy) {
@@ -661,6 +693,12 @@ def MonomialPart(f) {
   sm1(" [(lmonom) f] gbext /FunctionValue set ");
 }
 
+/* WARNING:
+  When you use SwhereInTower, you have to change gbList
+  as below. Ofcourse, you should restrore the gbList
+  SsetTower(StowerOf(tower,level));
+  pos = SwhereInTower(syzHead,tower[level]);
+*/
 def SwhereInTower(f,tower) {
   local i,n,p,q;
   if (f == Poly("0")) return(-1);
@@ -697,6 +735,8 @@ def SpairAndReduction(skel,level,ii,freeRes,tower,ww) 
 
   tower2 = StowerOf(tower,level-1);
   SsetTower(tower2);  
+  Println(["level=",level]);
+  Println(["tower2=",tower2]);
   /** sm1(" show_ring ");   */
 
   gi = Stoes_vec(bases[i]);
@@ -730,7 +770,11 @@ def SpairAndReduction(skel,level,ii,freeRes,tower,ww) 
   sj = sj*tmp[1]+t_syz[j];
   t_syz[i] = si; 
   t_syz[j] = sj;
+
+  SsetTower(StowerOf(tower,level));
   pos = SwhereInTower(syzHead,tower[level]);
+
+  SsetTower(StowerOf(tower,level-1));
   pos2 = SwhereInTower(tmp[0],tower[level-1]);
   ans = [tmp[0],t_syz,pos,pos2,vdeg,vdeg_reduced];
   /* pos is the place to put syzygy at level. */
@@ -843,12 +887,31 @@ def Sbases_to_vec(bases,size) {
   return(newbases);
 }
 
-def Sminimal(g) {
+HelpAdd(["Sminimal",
+["It constructs the V-minimal free resolution by LaScala-Stillman's algorithm",
+ "option: \"homogenized\" (no automatic homogenization ",
+ "Example:  Sweyl(\"x,y\",[[\"x\",-1,\"y\",-1,\"Dx\",1,\"Dy\",1]]);", 
+ "          v=[[2*x*Dx + 3*y*Dy+6, 0],",
+ "             [3*x^2*Dy + 2*y*Dx, 0],",
+ "             [0,  x^2+y^2],",
+ "             [0,  x*y]];",
+ "         a=Sminimal(v);",
+ "         Sweyl(\"x,y\",[[\"x\",-1,\"y\",-1,\"Dx\",1,\"Dy\",1]]);", 
+ "         b = ReParse(a[0]); sm1_pmat(b); ",
+ "         IsExact_h(b,[x,y]):",
+ "Note:  a[0] is the V-minimal resolution. a[3] is the Schreyer resolution."]]);
+
+def Sminimal(g,opt) {
   local r, freeRes, redundantTable, reducer, maxLevel,
         minRes, seq, maxSeq, level, betti, q, bases, dr,
-        betti_levelplus, newbases, i, j,qq;
-  r = SlaScala(g);
+        betti_levelplus, newbases, i, j,qq, tminRes;
+  if (Length(Arglist) < 2) {
+     opt = null;
+  }
+  ScheckIfSchreyer("Sminimal:0");
+  r = SlaScala(g,opt);
   /* Should I turn off the tower?? */
+  ScheckIfSchreyer("Sminimal:1");
   freeRes = r[0];
   redundantTable = r[1];
   reducer = r[2];
@@ -904,10 +967,12 @@ def Sminimal(g) {
       }
     }
    }
-   return([Stetris(minRes,redundantTable),
-          [ minRes, redundantTable, reducer,r[3],r[4]],r[0]]);
+   tminRes = Stetris(minRes,redundantTable);
+   return([SpruneZeroRow(tminRes), tminRes,
+          [ minRes, redundantTable, reducer,r[3],r[4]],r[0],r[5]]);
   /* r[4] is the redundantTable_ordinary */
   /* r[0] is the freeResolution */
+  /* r[5] is the skelton */
 }  
 
 
@@ -1136,6 +1201,10 @@ def Sschreyer(g) {
   rf = SresolutionFrameWithTower(g);
   redundant_seq = 1;   redundant_seq_ordinary = 1;
   tower = rf[1];
+  Println("Generating reduction table which gives an order of reduction.");
+  Println("But, you are in Sschreyer...., you may not use LaScala-Stillman");
+  Print("WeghtOfSweyl="); Println(WeightOfSweyl);
+  Print("tower"); Println(tower);
   reductionTable = SgenerateTable(tower);
   skel = rf[2];
   redundantTable = SnewArrayOfFormat(rf[1]);
@@ -1315,6 +1384,8 @@ def SpairAndReduction2(skel,level,ii,freeRes,tower,ww,
 
   tower2 = StowerOf(tower,level-1);
   SsetTower(tower2);  
+  Println(["level=",level]);
+  Println(["tower2=",tower2]);
   /** sm1(" show_ring ");   */
 
   gi = Stoes_vec(bases[i]);
@@ -1381,20 +1452,23 @@ def SpairAndReduction2(skel,level,ii,freeRes,tower,ww,
     }
   }
 
-
+  SsetTower(StowerOf(tower,level));
   pos = SwhereInTower(syzHead,tower[level]);
+
+  SsetTower(StowerOf(tower,level-1));
   pos2 = SwhereInTower(tmp[0],tower[level-1]);
   ans = [tmp[0],t_syz,pos,pos2,vdeg,vdeg_reduced,c2];
   /* pos is the place to put syzygy at level. */
   /* pos2 is the place to put a new GB at level-1. */   
   Println(ans);
-  Println("  ");
+  Println("--- end of SpairAndReduction2  ");
   return(ans);
 }
 
 HelpAdd(["Sminimal_v",
 ["It constructs the V-minimal free resolution from the Schreyer resolution",
  "step by step.",
+ "This code still contains bugs. It sometimes outputs wrong answer.",
  "Example:   Sweyl(\"x,y\",[[\"x\",-1,\"y\",-1,\"Dx\",1,\"Dy\",1]]);", 
  "          v=[[2*x*Dx + 3*y*Dy+6, 0],",
  "             [3*x^2*Dy + 2*y*Dx, 0],",
@@ -1404,7 +1478,9 @@ HelpAdd(["Sminimal_v",
  "         sm1_pmat(a[0]); b=a[0]; b[1]*b[0]:",
  "Note:  a[0] is the V-minimal resolution. a[3] is the Schreyer resolution."]]);
 
-
+/* This code still contains bugs. It sometimes outputs wrong answer. */
+/* See test12() in minimal-test.k.  */
+/* There may be remaining 1, too */
 def Sminimal_v(g) {
   local r, freeRes, redundantTable, reducer, maxLevel,
         minRes, seq, maxSeq, level, betti, q, bases, dr,
@@ -1641,48 +1717,77 @@ def sm1_gb(f,v) {
   sm1(" [f v] gb /FunctionValue set ");
 }
 
-def test5() {
-  local a,b,c,cc,v;
-  a = Sannfs3_laScala2("x^3-y^2*z^2");
-  b = a[0];
-  v = [x,y,z];
-  c = Skernel(b[0],v);
-  c = c[0];
-  sm1_pmat([c,b[1],v]);
-  Println("-----------------------------------");
-  cc = sm1_res_div(c,b[1],v);
-  sm1_pmat(sm1_gb(cc,v));
-  c = Skernel(b[1],v);
-  c = c[0];
-  cc = sm1_res_div(c,b[2],v);
-  sm1_pmat(sm1_gb(cc,v));
-  return(a);
+
+def SisComplex(a) {
+  local n,i,j,k,b,p,q;
+  n = Length(a);
+  for (i=0; i<n-1; i++) {
+    if (Length(a[i+1]) != 0) {
+      b = a[i+1]*a[i];
+      p = Length(b); q = Length(b[0]);
+      for (j=0; j<p; j++) {
+        for (k=0; k<q; k++) {
+          if (!IsZero(b[j,k])) {
+             Print("Is is not complex at ");
+             Println([i,j,k]);
+             return(false);
+          }
+        }
+      }
+    }
+  }
+  return(true);
 }
-def test6() {
-  local a,b,c,cc,v;
-  a = Sannfs3("x^3-y^2*z^2");
-  b = a[0];
-  v = [x,y,z];
-  c = Skernel(b[0],v);
-  c = c[0];
-  sm1_pmat([c,b[1],v]);
-  Println("-------ker = im for minimal ?---------------------");
-  cc = sm1_res_div(c,b[1],v);
-  sm1_pmat(sm1_gb(cc,v));
-  c = Skernel(b[1],v);
-  c = c[0];
-  cc = sm1_res_div(c,b[2],v);
-  sm1_pmat(sm1_gb(cc,v));
-  Println("------ ker=im for Schreyer ?------------------");
-  b = a[3];
-  c = Skernel(b[0],v);
-  c = c[0];
-  sm1_pmat([c,b[1],v]);
-  cc = sm1_res_div(c,b[1],v);
-  sm1_pmat(sm1_gb(cc,v));
-  c = Skernel(b[1],v);
-  c = c[0];
-  cc = sm1_res_div(c,b[2],v);
-  sm1_pmat(sm1_gb(cc,v));
-  return(a);
-}
+
+def IsExact_h(c,v) {
+  local a;
+  v = ToString_array(v);
+  a = [c,v];
+  sm1(a," isExact_h /FunctionValue set ");
+}
+HelpAdd(["IsExact_h",
+["IsExact_h(complex,var): bool",
+ "It checks the given complex is exact or not in D<h> (homogenized Weyl algebra)",
+ "cf. ReParse"
+]]);
+
+def ReParse(a) {
+  local c;
+  if (IsArray(a)) {
+    c = Map(a,"ReParse");
+  }else{
+    sm1(a," toString . /c set");
+  }
+  return(c);
+}
+HelpAdd(["ReParse",
+["Reparse(obj): obj",
+ "It parses the given object in the current ring.",
+ "Outputs from SlaScala, Sschreyer may cause a trouble in other functions,",
+ "because it uses the Schreyer order.",
+ "In this case, ReParse the outputs from these functions.",
+ "cf. IsExaxt_h"
+]]);
+
+def ScheckIfSchreyer(s) {
+  local ss;
+  sm1(" (report) (grade) switch_function /ss set ");
+  if (ss != "module1v") {
+     Print("ScheckIfSchreyer: from "); Println(s);
+     Error("grade is not module1v");
+  }
+  /*
+  sm1(" (report) (mmLarger) switch_function /ss set ");
+  if (ss != "tower") {
+     Print("ScheckIfSchreyer: from "); Println(s);
+     Error("mmLarger is not tower");
+  }
+  */
+  sm1(" [(Schreyer)] system_variable (universalNumber) dc /ss set ");
+  if (ss != 1) {
+     Print("ScheckIfSchreyer: from "); Println(s);
+     Error("Schreyer order is not set.");
+  }
+  /* More check will be necessary. */
+  return(true);
+}
\ No newline at end of file