[BACK]Return to minimal-test.k CVS log [TXT][DIR] Up to [local] / OpenXM / src / k097 / lib / minimal

Diff for /OpenXM/src/k097/lib/minimal/minimal-test.k between version 1.3 and 1.6

version 1.3, 2000/06/09 08:04:54 version 1.6, 2000/07/26 02:21:31
Line 1 
Line 1 
 /* $OpenXM: OpenXM/src/k097/lib/minimal/minimal-test.k,v 1.2 2000/06/08 08:37:53 takayama Exp $ */  /* $OpenXM: OpenXM/src/k097/lib/minimal/minimal-test.k,v 1.5 2000/06/15 07:38:35 takayama Exp $ */
 load["minimal.k"];  load["minimal.k"];
 def test5() {  def test5() {
   local a,b,c,cc,v;    local a,b,c,cc,v;
Line 214  def test11() {
Line 214  def test11() {
   return(a);    return(a);
 }  }
 /* f should be a string. */  /* f should be a string. */
   /* a=test_ann3("x^3+y^3+z^3");
   It returns the following resolution in 1.5 hours.  June 14, 2000.
    [
     [
       [    x*Dx+y*Dy+z*Dz-3*h^2 ]
       [    -z*Dy^2+y*Dz^2 ]
       [    -z*Dx^2+x*Dz^2 ]
       [    -y*Dx^2+x*Dy^2 ]
     ]
     [
       [    0 , -x , y , -z ]
       [    z*Dx^2-x*Dz^2 , x*Dy , x*Dx+z*Dz-3*h^2 , z*Dy ]
       [    y*Dx^2-x*Dy^2 , -x*Dz , y*Dz , x*Dx+y*Dy-3*h^2 ]
       [    0 , Dx^2 , -Dy^2 , Dz^2 ]
       [    z*Dy^2-y*Dz^2 , x*Dx+y*Dy+z*Dz-2*h^2 , 0 , 0 ]
     ]
     [
       [    -x*Dx+3*h^2 , y , -z , 0 , -x ]
       [    Dy^3+Dz^3 , Dy^2 , -Dz^2 , x*Dx+y*Dy+z*Dz , -Dx^2 ]
     ]
    ]
   */
 def test_ann3(f) {  def test_ann3(f) {
   local a,v,ww2,ans2;    local a,v,ww2,ans2;
   a = Sannfs3_laScala2(f);    a = Sannfs3_laScala2(f);
Line 279  def test12() {
Line 301  def test12() {
   ans2 = a[0];    ans2 = a[0];
   v = [x,y,z];    v = [x,y,z];
   ww2 = [["x",-1,"y",-1,"z",-1,"Dx",1,"Dy",1,"Dz",1]];    ww2 = [["x",-1,"y",-1,"z",-1,"Dx",1,"Dy",1,"Dz",1]];
   Sweyl("x,y,z",ww2);    Sweyl("x,y,z",ww2);
   ans2 = ReParse(ans2);    ans2 = ReParse(ans2); /* DO NOT FORGET! */
   r= IsExact_h(ans2,[x,y,z]);    r= IsExact_h(ans2,[x,y,z]);
   Println(r);    Println(r);
   Println("It may stop by non-exact statement. The code of Sminimal_v (non-LaScala-Stillman contains bugs.");    Println("It may stop by non-exact statement. The code of Sminimal_v (non-LaScala-Stillman contains bugs.");
   return([r,ans2]);    return([r,ans2]);
 }  }
   
   def test13() {
     Println("test13 try to construct a minimal free resolution");
     Println("of a GKZ system [[1,2]]. 6/12, 2000.");
     ans2 = GKZ([[1,2]],[0]);
      /* Be careful!! It resets the grade to module1, not module1v */
     ww2 = [["x1",-1,"x2",-1,"Dx1",1,"Dx2",1]];
     Sweyl("x1,x2",ww2);
     ans2 = ReParse(ans2[0]);
     Println(ans2);
     return(Sminimal(ans2));
   }
   
   def test14() {
     Println("test14 try to construct a minimal free resolution");
     Println("of a GKZ system [[1,2,3]]. 6/12, 2000.");
     ans2 = GKZ([[1,2,3]],[0]);
        /* It stops by the strategy error.
           July 26, 2000. It works fine after fixing a bug in resol.c */
     ww2 = [["x1",-1,"x2",-1,"x3",-1,"Dx1",1,"Dx2",1,"Dx3",1]];
     Sweyl("x1,x2,x3",ww2);
     ans2 = ReParse(ans2[0]);
     return(Sminimal(ans2));
   }
   def test14a() {
     Println("test14a try to construct a minimal free resolution");
     Println("of a GKZ system [[1,2,3]]. 6/12, 2000.");
     Println("Without automatic homogenization.");
     ww2 = [["x1",-1,"x2",-1,"x3",-1,"Dx1",1,"Dx2",1,"Dx3",1]];
     Sweyl("x1,x2,x3",ww2);
     ans2 = [x1*Dx1+2*x2*Dx2+3*x3*Dx3 , Dx1^2-Dx2*h , -Dx1*Dx2+Dx3*h ,
             Dx2^2-Dx1*Dx3 ];
     ans2 = ReParse(ans2);
     return(Sminimal(ans2,"homogenized"));
   }
   
   def test15() {
     Println("test15 try to construct a minimal free resolution");
     Println("of a GKZ system [[1,2,3]] by the order filt. 6/12, 2000.");
     ww2 = [["Dx1",1,"Dx2",1,"Dx3",1]];
     Sweyl("x1,x2,x3",ww2);
     ans2 = GKZ([[1,2,3]],[0]);
     ans2 = ReParse(ans2[0]);
     return(Sminimal(ans2));
   }
   
   def test15b() {
     Println("test15b try to construct a minimal free resolution");
     Println("of toric [[1,2,3]] by the order filt. 6/12, 2000.");
     ww2 = [["Dx1",1,"Dx2",1,"Dx3",1]];
     Sweyl("x1,x2,x3",ww2);
     ans2 = [Dx1^2-Dx2*h , -Dx1*Dx2+Dx3*h , Dx2^2-Dx1*Dx3 ];
     ans2 = ReParse(ans2);
     return(Sminimal(ans2,"homogenized"));
   }
   
   def test16() {
     Println("test16 try to construct a minimal free resolution");
     Println("of a GKZ system [[1,2,3,5]] by the order filt. 6/12, 2000.");
     ww2 = [["Dx1",1,"Dx2",1,"Dx3",1,"Dx4",1]];
     Sweyl("x1,x2,x3,x4",ww2);
     ans2 = GKZ([[1,2,3,5]],[0]);
     ans2 = ReParse(ans2[0]);
     return(Sminimal(ans2));
   }
   
   def test16b() {
     Println("test16b try to construct a minimal free resolution");
     Println("of a toric [[1,2,3,5]] by the order filt. 6/12, 2000.");
     ww2 = [["Dx1",1,"Dx2",1,"Dx3",1,"Dx4",1]];
     Sweyl("x1,x2,x3,x4",ww2);
     ans2 = GKZ([[1,2,3,5]],[0]);
     ans3 = Rest(ans2[0]);
     ans3 = ReParse(ans3);
     Println("Toric variety:");
     Println(ans3);
     return(Sminimal(ans3));
   }
   
   
   
   
Legend:
Removed from v.1.3  
changed lines
  Added in v.1.6
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>