Changeset 8dee80 in git

Timestamp:

Jun 7, 2006, 10:21:40 PM (17 years ago)

Author:

Viktor Levandovskyy <levandov@…>

Branches:

(u'spielwiese', '828514cf6e480e4bafc26df99217bf2a1ed1ef45')

Children:

4b70490a6e3256b1c055ca790e7c971610b648e3

Parents:

32ed4fc37e1059f0d3c41fabbf67bc1a35b74faa

Message:

*levandov: enhancements in the documentation


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

File:

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

Singular/LIB/dmod.lib

@@ -1 +1 @@
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: dmod.lib,v 1.3 2006-05-08 14:43:21 levandov Exp $";
+version="$Id: dmod.lib,v 1.4 2006-06-07 20:21:40 levandov Exp $";
 category="Noncommutative";
 info="
 LIBRARY: dmod.lib     Algorithms for algebraic D-modules
-AUTHORS: Viktor Levandovskyy,     levandov@mathematik.uni-kl.de
-@*         Jorge Martin Morales,      jorge@unizar.es
+AUTHORS: Viktor Levandovskyy,     levandov@risc.uni-linz.ac.at
+@*       Jorge Martin Morales,    jorge@unizar.es
 
 THEORY: Given a polynomial ring R = K[x_1,...,x_n] and a polynomial F in R, one is interested in the ring R[1/F^s] for a natural number s. 
@@ -13 +13 @@
 @* We provide two implementations: 
 @* 1) the classical Ann F^s algorithm from Oaku and Takayama (J. Pure Applied Math., 1999) and
-@* 2) the newer Ann F^s algorithm by Briancon and Maisonobe.
+@* 2) the newer Ann F^s algorithm by Briancon and Maisonobe (Remarques sur l ideal de Bernstein associe a des polynomes, preprint, 2002).
 
 PROCEDURES:
@@ -36 +36 @@
 proc engine(ideal I, int i)
 {
-  /* std / slimgb mix */
+  /* std - slimgb mix */
   ideal J;
   if (i==0)
@@ -44 +44 @@
   else
   {
-    // without options -> buggy!!! (ringlist?)
+    // without options -> strange! (ringlist?)
     option(redSB);
     option(redTail);
@@ -1101 +1101 @@
 PURPOSE: check the modules for the property of holonomy
 NOTE:    M is holonomic, if 2*dim(M) = dim(R), where R is a
-ground ring
+ground ring; dim stays for Gelfand-Kirillov dimension
 EXAMPLE: example isHolonomic; shows examples
 " 
@@ -1128 +1128 @@
   isHolonomic(LD);
   ideal I = std(LD[1]);
+  I;
   isHolonomic(I);  
 }
@@ -1149 +1150 @@
     return(0);
   }
-  ring @r = 0,(x,y),ds;
+  ring @r = 0,(x,y),dp;
   poly RC = y^q +x^p + x*y^(q-1);
   export RC;
@@ -1329 +1330 @@
   LIB "gkdim.lib";
   gkdim(LD); // a holonomic check
-  //  poly F = x^3-y^2; // = x^7 - y^5; // x^3-y^4; // x^5 - y^4;
 }