Changeset 3cec5e in git

Timestamp:

Feb 12, 2009, 9:25:23 PM (14 years ago)

Author:

Viktor Levandovskyy <levandov@…>

Branches:

(u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')

Children:

fec31e1b0b4219695838afd56e61b869215483ec

Parents:

40165d708d5c5de0e1ae9846acbc8942e2533da5

Message:

*levandov: fixes and doc improvements, bfun instead of bfct_lib


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

Location:

Singular/LIB

Files:

• all.lib (modified) (2 diffs)
• bfun.lib (added)
• dmod.lib (modified) (8 diffs)
• dmodapp.lib (modified) (3 diffs)

Singular/LIB/all.lib

@@ -1 @@
-// $Id: all.lib,v 1.59 2008-10-07 09:16:09 Singular Exp $
+// $Id: all.lib,v 1.60 2009-02-12 20:25:23 levandov Exp $
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: all.lib,v 1.59 2008-10-07 09:16:09 Singular Exp $";
+version="$Id: all.lib,v 1.60 2009-02-12 20:25:23 levandov Exp $";
 category = "General purpose";
 info="
@@ -88 +88 @@
 LIB "zeroset.lib";
 LIB "phindex.lib";
-LIB "bfct.lib";
+LIB "bfun.lib";
 LIB "central.lib";
 LIB "discretize.lib";

Singular/LIB/dmod.lib

@@ -1 +1 @@
 //////////////////////////////////////////////////////////////////////////////
-version="$Id: dmod.lib,v 1.34 2009-01-14 16:07:04 Singular Exp $";
+version="$Id: dmod.lib,v 1.35 2009-02-12 20:25:22 levandov Exp $";
 category="Noncommutative";
 info="
@@ -73 +73 @@
 
 
-SEE ALSO: gmssing_lib, bfct_lib, dmodapp_lib
+SEE ALSO: gmssing_lib, bfun_lib, dmodapp_lib
 ";
 
@@ -1887 +1887 @@
 //  poly F = x^3+y^3+z^2*w;
 
-// TODO: 1 has to appear in the 2nd column of transp. matrix
+// TODO: 1 has to appear in the 1nd column of transp. matrix
 // this does not happen automatically
-// for this, do special modulo with emphasis on the 2comp
+// for this, do special modulo with emphasis on the 1comp (c,<)
 // of the transp matrix, there must appear 1 in the GB
 // then use lift to get the expression...
@@ -1898 +1898 @@
 "USAGE:  operatorModulo(f,I,b);  f a poly, I an ideal, b a poly
 RETURN:  poly
-PURPOSE: compute the B-operator from the poly F, ideal I = Ann f^s and Bernstein-Sato
-polynomial b using modulo
+PURPOSE: compute the B-operator from the poly f, ideal I = Ann f^s and Bernstein-Sato
+polynomial b using modulo i.e. kernel of module homomorphism
 NOTE:  The computations take place in the ring, similar to the one returned by Sannfs procedure.
 @*       If printlevel=1, progress debug messages will be printed,
@@ -3409 +3409 @@
 "USAGE:  SannfsBFCT(f [,eng]);  f a poly, eng an optional int
 RETURN:  ring
-PURPOSE: compute the D-module structure of basering[1/f]*f^s, according to the 1st step of the algorithm by Briancon and Maisonobe in the ring D[s], where D is the Weyl algebra
+PURPOSE: compute ann f^s and Groebner basis of ann f^s+f in D[s]
 NOTE:    activate this ring with the @code{setring} command.
 @*       This procedure, unlike SannfsBM, returns a ring with the degrevlex ordering in all variables.
-@*       In the ring D[s], the ideal LD (which is NOT a Groebner basis) is the needed D-module structure,
+@*       In the ring D[s], the ideal LD (which IS a Groebner basis) is the needed ideal.
 @*       If eng <>0, @code{std} is used for Groebner basis computations,
 @*       otherwise, and by default @code{slimgb} is used.
@@ -3420 +3420 @@
 "
 {
+  // DEBUG INFO: ordering on the output ring = dp, engine on the sum of ideals is used
+  // hence it's the situation for slimgb
+
   int eng = 0;
   if ( size(#)>0 )
@@ -3587 +3590 @@
   dbprint(ppl-1, LD);
   LD = engine(LD,eng);
+  dbprint(ppl,"//  -2-3- finished GB computations for Ann f^s + f");
+  dbprint(ppl-1, LD);
+  // make leadcoeffs positive
+  for (i=1; i<= ncols(LD); i++)
+  {
+    if (leadcoef(LD[i]) <0 )
+    {
+      LD[i] = -LD[i];
+    }
+  }
+  export LD;
+  kill @R;
+  return(@R2);
+}
+example
+{
+  "EXAMPLE:"; echo = 2;
+  ring r = 0,(x,y,z,w),Dp;
+  poly F = x^3+y^3+z^3*w;
+  printlevel = 0;
+  def A = SannfsBFCT(F); setring A;
+  intvec v = 1,2,3,4,5,6,7,8;
+  // are there polynomials, depending on s only?
+  nselect(LD,v);
+  // a fancier example:
+  def R = reiffen(4,5); setring R;
+  v = 1,2,3,4;
+  RC; // the Reiffen curve in 4,5
+  def B = SannfsBFCT(RC);
+  setring B;
+  // are there polynomials, depending on s only?
+  nselect(LD,v);
+  // it is not the case. Are there leading monomials in s only?
+  nselect(lead(LD),v);
+}
+
+proc SannfsBFCTstd(poly F, list #)
+"USAGE:  SannfsBFCTstd(f [,eng]);  f a poly, eng an optional int
+RETURN:  ring
+PURPOSE: compute ann f^s and Groebner basis of ann f^s+f in D[s]
+NOTE:    activate this ring with the @code{setring} command.
+@*       This procedure, unlike SannfsBM, returns a ring with the degrevlex ordering in all variables.
+@*       In the ring D[s], the ideal LD (which IS a Groebner basis) is the needed ideal.
+@*       In this procedure @code{std} is used for Groebner basis computations.
+DISPLAY: If printlevel=1, progress debug messages will be printed,
+@*       if printlevel>=2, all the debug messages will be printed.
+EXAMPLE: example SannfsBFCTstd; shows examples
+"
+{
+  // DEBUG INFO: ordering on the output ring = dp, 
+  // use std(K,F); for reusing the std property of K
+
+  int eng = 0;
+  if ( size(#)>0 )
+  {
+    if ( typeof(#[1]) == "int" )
+    {
+      eng = int(#[1]);
+    }
+  }
+  // returns a list with a ring and an ideal LD in it
+  int ppl = printlevel-voice+2;
+  //  printf("plevel :%s, voice: %s",printlevel,voice);
+  def save = basering;
+  int N = nvars(basering);
+  int Nnew = 2*N+2;
+  int i,j;
+  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];
+  list RName;
+  RName[1] = "@t";
+  RName[2] = "@s";
+  for(i=1;i<=N;i++)
+  {
+    for(j=1; j<=size(RName);j++)
+    {
+      if (Name[i] == RName[j])
+      {
+        ERROR("Variable names should not include @t,@s");
+      }
+    }
+  }
+  // now, create the names for new vars
+  list DName;
+  for(i=1;i<=N;i++)
+  {
+    DName[i] = "D"+Name[i]; // concat
+  }
+  tmp[1] = "t";
+  tmp[2] = "s";
+  list NName = tmp + DName + Name ;
+  L[2]   = NName;
+  // Name, Dname will be used further
+  kill NName;
+  // block ord (lp(2),dp);
+  tmp[1]  = "lp"; // string
+  iv      = 1,1;
+  tmp[2]  = iv; //intvec
+  Lord[1] = tmp;
+  // continue with dp 1,1,1,1...
+  tmp[1]  = "dp"; // string
+  s       = "iv=";
+  for(i=1;i<=Nnew;i++)
+  {
+    s = s+"1,";
+  }
+  s[size(s)]= ";";
+  execute(s);
+  kill s;
+  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
+  def @R@ = ring(L);
+  setring @R@;
+  matrix @D[Nnew][Nnew];
+  @D[1,2]=t;
+  for(i=1; i<=N; i++)
+  {
+    @D[2+i,N+2+i]=-1;
+  }
+  //  L[5] = matrix(UpOneMatrix(Nnew));
+  //  L[6] = @D;
+  def @R = nc_algebra(1,@D);
+  setring @R;
+  kill @R@;
+  dbprint(ppl,"// -1-1- the ring @R(t,s,_Dx,_x) is ready");
+  dbprint(ppl-1, @R);
+  // create the ideal I
+  poly  F = imap(save,F);
+  ideal I = t*F+s;
+  poly p;
+  for(i=1; i<=N; i++)
+  {
+    p = t; // t
+    p = diff(F,var(N+2+i))*p;
+    I = I, var(2+i) + p;
+  }
+  // -------- the ideal I is ready ----------
+  dbprint(ppl,"// -1-2- starting the elimination of t in @R");
+  dbprint(ppl-1, I);
+  ideal J = engine(I,eng);
+  ideal K = nselect(J,1);
+  dbprint(ppl,"// -1-3- t is eliminated");
+  dbprint(ppl-1, K);  // K is without t
+  K = engine(K,eng);  // std does the job too
+  // now, we must change the ordering
+  // and create a ring without t
+  //  setring S;
+  // ----------- the ring @R3 ------------
+  // _Dx,_x,s;  +fast ord !
+  // keep: N, i,j,s, tmp, RL
+  Nnew = 2*N+1;
+  kill Lord, tmp, iv, RName;
+  list Lord, tmp;
+  intvec iv;
+  list L=imap(save,L);
+  list RL=imap(save,RL);
+  L[1] = RL[1];
+  L[4] = RL[4];  // char, minpoly
+  // check whether vars hava admissible names -> done earlier
+  // now, create the names for new var
+  tmp[1] = "s";
+  // DName is defined earlier
+  list NName = DName + Name + tmp;
+  L[2] = NName;
+  tmp = 0;
+  // just dp
+  // block ord (dp(N),dp);
+  string s = "iv=";
+  for (i=1; i<=Nnew; i++)
+  {
+    s = s+"1,";
+  }
+  s[size(s)]=";";
+  execute(s);
+  tmp[1] = "dp";  // string
+  tmp[2] = iv;   // intvec
+  Lord[1] = tmp;
+  kill s;
+  kill NName;
+  tmp[1]      = "C";
+  Lord[2]     = tmp;  tmp = 0;
+  L[3]        = Lord;
+  // we are done with the list. Now add a Plural part
+  def @R2@ = ring(L);
+  setring @R2@;
+  matrix @D[Nnew][Nnew];
+  for (i=1; i<=N; i++)
+  {
+    @D[i,N+i]=-1;
+  }
+  def @R2 = nc_algebra(1,@D);
+  setring @R2;
+  kill @R2@;
+  dbprint(ppl,"//  -2-1- the ring @R2(_Dx,_x,s) is ready");
+  dbprint(ppl-1, @R2);
+  ideal MM = maxideal(1);
+  MM = 0,s,MM;
+  map R01 = @R, MM;
+  ideal K = R01(K);
+  // total cleanup
+  poly F = imap(save, F);
+  //  ideal LD = K,F;
+  dbprint(ppl,"//  -2-2- start GB computations for Ann f^s + f");
+  //  dbprint(ppl-1, LD);
+  ideal LD = std(K,F);
+  //  LD = engine(LD,eng);
   dbprint(ppl,"//  -2-3- finished GB computations for Ann f^s + f");
   dbprint(ppl-1, LD);
@@ -5068 +5291 @@
   // check whether basering is D[s]=K(_x,_Dx,s)
   list Name = RL[2];
-  for (i=1; i<=n; i++)
-  {
-    if ( bracket(var(i+n),var(i))!=1 )
-    {
-      ERROR("basering should be D[s]=K(_x,_Dx,s)");
-    }
-  }
+//   for (i=1; i<=n; i++)
+//   {
+//     if ( bracket(var(i+n),var(i))!=1 )
+//     {
+//       ERROR("basering should be D[s]=K(_x,_Dx,s)");
+//     }
+//   }
   if ( Name[N]!="s" )
   {

Singular/LIB/dmodapp.lib

@@ -1 +1 @@
 //////////////////////////////////////////////////////////////////////////////
-version="$Id: dmodapp.lib,v 1.17 2009-01-15 19:19:08 levandov Exp $";
+version="$Id: dmodapp.lib,v 1.18 2009-02-12 20:25:23 levandov Exp $";
 category="Noncommutative";
 info="
@@ -49 +49 @@
 
 
-SEE ALSO: dmod_lib, gmssing_lib, bfct_lib
+SEE ALSO: dmod_lib, gmssing_lib, bfun_lib
 ";
 
@@ -56 +56 @@
 LIB "primdec.lib";
 LIB "dmod.lib"; // loads e.g. nctools.lib
-LIB "bfct.lib";
+LIB "bfun.lib"; //formerly LIB "bfct.lib";
 
 // todo: complete and include into above list