Changeset 800a62 in git

Timestamp:

Mar 9, 2010, 10:24:47 PM (13 years ago)

Author:

Viktor Levandovskyy <levandov@…>

Branches:

(u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')

Children:

ea590fa528c7ccd8037ce62d79d09f081a0af332

Parents:

cfbee28a6ff075e6e44432df114e0bd291f54bfa

Message:

*levandov: Sannfslog returns now the same ring as Sannfs

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

File:

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

Singular/LIB/dmod.lib

@@ -90 +90 @@
 ";
 
+// reworked by JM+VL on 9.3.2010: Sannfslog
 // added by VL on 2.3.2010: bernsteinLift
 // ****** commented out for better readability by VL on 2.3.2010
@@ -451 +452 @@
   tmp[1] = "s";
   list NName;
-  for (i=1; i<=N; i++)
-  {
-    NName[2*i-1] = Name[i];
-    NName[2*i] = DName[i];
-    //NName[2*i-1] = DName[i];
-    //NName[2*i] = Name[i];
-  }
-  NName[Nnew] = tmp[1];
+  NName = Name + DName + tmp;
   L[2] = NName;
   tmp = 0;
-  // block ord (a(1,1),a(0,0,1,1),...,dp);
-  //list("a",intvec(1,1)), list("a",intvec(0,0,1,1)), ...
-  tmp[1] = "a";  // string
-  for (i=1; i<=N; i++)
-  {
-    iv[2*i-1] = 1;
-    iv[2*i]   = 1;
-    tmp[2]    = iv;  iv = 0;  // intvec
-    Lord[i]   = tmp;
-  }
-  //list("dp",intvec(1,1,1,1,1,...))
+  // block ord (dp(N),dp);
   s = "iv=";
-  for (i=1; i<=Nnew; i++)
+  for (i=1; i<=Nnew-1; i++)
   {
     s = s+"1,";
@@ -479 +463 @@
   s[size(s)]=";";
   execute(s);
+  tmp[1] = "dp";  // string
+  tmp[2] = iv;   // intvec
+  Lord[1] = tmp;
+  // continue with dp 1,1,1,1...
+  tmp[1] = "dp";  // string
+  s[size(s)] = ",";
+  s = s+"1;";
+  execute(s);
   kill s;
-  tmp[1] = "dp";  // string
-  tmp[2] = iv;    // intvec
-  Lord[N+1] = tmp;
-  //list("C",intvec(0))
-  tmp[1] = "C";  // string
-  iv = 0;
-  tmp[2] = iv;   // intvec
-  Lord[N+2] = tmp;
-  tmp = 0;
-  L[3]    = Lord;
+  kill NName;
+  tmp[2]      = iv;
+  Lord[2]     = tmp;
+  tmp[1]      = "C";  iv  = 0;  tmp[2]=iv;
+  Lord[3]     = tmp;  tmp = 0;
+  L[3]        = Lord;
   // we are done with the list. Now add a Plural part
   def @R@ = ring(L);
@@ -496 +484 @@
   for (i=1; i<=N; i++)
   {
-    @D[2*i-1,2*i]=1;
-    //@D[2*i-1,2*i]=-1;
+    @D[i,N+i]=1;
   }
   def @R = nc_algebra(1,@D);
@@ -509 +496 @@
   for (i=1; i<=N; i++)
   {
-    v = v + var(2*i)*gen(i+1);
-    //v = v + var(2*i-1)*gen(i+1);
+    v = v + var(i+N)*gen(i+1);
   }
   ideal J = ideal(M*v);
@@ -530 +516 @@
   "EXAMPLE:"; echo = 2;
   ring r = 0,(x,y),Dp;
-  poly F = x^4+y^5+x*y^4;
+  poly F = x4+y5+x*y4;
   printlevel = 0;
   def A  = Sannfslog(F);
@@ -536 +522 @@
   LD1;
 }
+
+// JM+VL: output ring restructured into "normal"
+
+// proc Sannfslog (poly F, list #)
+// "USAGE:  Sannfslog(f [,eng]);  f a poly, eng an optional int
+// RETURN:  ring
+// PURPOSE: compute the D-module structure of basering[1/f]*f^s
+// NOTE:    activate the output ring with the @code{setring} command.
+// @*   In the output ring D[s], the ideal LD1 is generated by the elements
+// @*   in Ann F^s in D[s], coming from logarithmic derivations.
+// @*       If eng <>0, @code{std} is used for Groebner basis computations,
+// @*       otherwise, and by default @code{slimgb} is used.
+// DISPLAY: If @code{printlevel}=1, progress debug messages will be printed,
+// @*          if @code{printlevel}>=2, all the debug messages will be printed.
+// EXAMPLE: example Sannfslog; shows examples
+// "
+// {
+//   int eng = 0;
+//   if ( size(#)>0 )
+//   {
+//     if ( typeof(#[1]) == "int" )
+//     {
+//       eng = int(#[1]);
+//     }
+//   }
+//   int ppl = printlevel-voice+2;
+//   def save = basering;
+//   int N = nvars(basering);
+//   int Nnew = 2*N+1;
+//   int i;
+//   string s;
+//   list RL = ringlist(basering);
+//   list L, Lord;
+//   list tmp;
+//   intvec iv;
+//   L[1] = RL[1]; // char
+//   L[4] = RL[4]; // char, minpoly
+//   // check whether vars have admissible names
+//   list Name = RL[2];
+//   for (i=1; i<=N; i++)
+//   {
+//     if (Name[i] == "s")
+//     {
+//       ERROR("Variable names should not include s");
+//     }
+//   }
+//   // the ideal I
+//   ideal I = -F, jacob(F);
+//   dbprint(ppl,"// -1-1- starting the computation of syz(-F,_Dx(F))");
+//   dbprint(ppl-1, I);
+//   matrix M = syz(I);
+//   M = transpose(M);  // it is more usefull working with columns
+//   dbprint(ppl,"// -1-2- the module syz(-F,_Dx(F)) has been computed");
+//   dbprint(ppl-1, M);
+//   // ------------ the ring @R ------------
+//   // _x, _Dx, s;  elim.ord for _x,_Dx.
+//   // now, create the names for new vars
+//   list DName;
+//   for (i=1; i<=N; i++)
+//   {
+//     DName[i] = "D"+Name[i]; // concat
+//   }
+//   tmp[1] = "s";
+//   list NName;
+//   for (i=1; i<=N; i++)
+//   {
+//     NName[2*i-1] = Name[i];
+//     NName[2*i] = DName[i];
+//     //NName[2*i-1] = DName[i];
+//     //NName[2*i] = Name[i];
+//   }
+//   NName[Nnew] = tmp[1];
+//   L[2] = NName;
+//   tmp = 0;
+//   // block ord (a(1,1),a(0,0,1,1),...,dp);
+//   //list("a",intvec(1,1)), list("a",intvec(0,0,1,1)), ...
+//   tmp[1] = "a";  // string
+//   for (i=1; i<=N; i++)
+//   {
+//     iv[2*i-1] = 1;
+//     iv[2*i]   = 1;
+//     tmp[2]    = iv;  iv = 0;  // intvec
+//     Lord[i]   = tmp;
+//   }
+//   //list("dp",intvec(1,1,1,1,1,...))
+//   s = "iv=";
+//   for (i=1; i<=Nnew; i++)
+//   {
+//     s = s+"1,";
+//   }
+//   s[size(s)]=";";
+//   execute(s);
+//   kill s;
+//   tmp[1] = "dp";  // string
+//   tmp[2] = iv;    // intvec
+//   Lord[N+1] = tmp;
+//   //list("C",intvec(0))
+//   tmp[1] = "C";  // string
+//   iv = 0;
+//   tmp[2] = iv;   // intvec
+//   Lord[N+2] = tmp;
+//   tmp = 0;
+//   L[3]    = Lord;
+//   // we are done with the list. Now add a Plural part
+//   def @R@ = ring(L);
+//   setring @R@;
+//   matrix @D[Nnew][Nnew];
+//   for (i=1; i<=N; i++)
+//   {
+//     @D[2*i-1,2*i]=1;
+//     //@D[2*i-1,2*i]=-1;
+//   }
+//   def @R = nc_algebra(1,@D);
+//   setring @R;
+//   kill @R@;
+//   dbprint(ppl,"// -2-1- the ring @R(_x,_Dx,s) is ready");
+//   dbprint(ppl-1, @R);
+//   matrix M = imap(save,M);
+//   // now, create the vector [-s,_Dx]
+//   vector v = [-s];  // now s is a variable
+//   for (i=1; i<=N; i++)
+//   {
+//     v = v + var(2*i)*gen(i+1);
+//     //v = v + var(2*i-1)*gen(i+1);
+//   }
+//   ideal J = ideal(M*v);
+//   // make leadcoeffs positive
+//   for (i=1; i<= ncols(J); i++)
+//   {
+//     if ( leadcoef(J[i])<0 )
+//     {
+//       J[i] = -J[i];
+//     }
+//   }
+//   ideal LD1 = J;
+//   kill J;
+//   export LD1;
+//   return(@R);
+// }
+// example
+// {
+//   "EXAMPLE:"; echo = 2;
+//   ring r = 0,(x,y),Dp;
+//   poly F = x^4+y^5+x*y^4;
+//   printlevel = 0;
+//   def A  = Sannfslog(F);
+//   setring A;
+//   LD1;
+// }