Changeset 437f97 in git

Timestamp:

May 8, 2006, 4:43:21 PM (17 years ago)

Author:

Viktor Levandovskyy <levandov@…>

Branches:

(u'spielwiese', '8d54773d6c9e2f1d2593a28bc68b7eeab54ed529')

Children:

94d338aa149a7a6fa6d2930a62d22a4fd281c84b

Parents:

ff4c61b0d0fe25c31754910a1f80242d7086075f

Message:

*levandov: cosmetic changes to names and descroption


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

File:

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

Singular/LIB/dmod.lib

@@ -1 +1 @@
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: dmod.lib,v 1.2 2006-04-24 16:00:14 levandov Exp $";
+version="$Id: dmod.lib,v 1.3 2006-05-08 14:43:21 levandov Exp $";
 category="Noncommutative";
 info="
@@ -9 +9 @@
 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. 
 @* In fact, the ring R[1/F^s] has a structure of a D(R)-module, where D(R) is a Weyl algebra K<x_1,...,x_n,d_1,...,d_n | d_j x_j = x_j d_j +1>.
-@* Constructively, one needs to find an ideal I = I(F^s) in D(R), such
+@* Constructively, one needs to find a left ideal I = I(F^s) in D(R), such
 that K[x_1,...,x_n,1/F^s] is isomorphic to D(R)/I as a D(R)-module.
 @* 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 Brianson and Maisonobe.
+@* 2) the newer Ann F^s algorithm by Briancon and Maisonobe.
 
 PROCEDURES:
 annfsOT(F[,eng]);    compute Ann F^s for a poly F with the algorithm of Oaku-Takayama
-annfsBM(F[,eng]);    compute Ann F^s for a poly F with the algorithm of Brianson-Maisonobe
+annfsBM(F[,eng]);    compute Ann F^s for a poly F with the algorithm of Briancon-Maisonobe
 reiffen(p,q);      create the polynomial, describing a Reiffen curve
 arrange(p);        create the polynomial, describing a generic hyperplane arrangement
@@ -55 +55 @@
 "USAGE:  annfsBM(f [,eng]);  f a poly, eng an optional int
 RETURN:  ring
-PURPOSE: compute the D-module structure of basering[f^s]
+PURPOSE: compute the D-module structure of basering[f^s], according
+to the algorithm by Briancon and Maisonobe
 NOTE:    activate this ring with the @code{setring} command. In this ring,
 @*       - the ideal LD is the needed D-mod structure,
@@ -331 +332 @@
 "USAGE:  annfsOT(f [,eng]);  f a poly, eng an optional int
 RETURN:  ring
-PURPOSE: compute the D-module structure of basering[f^s]
+PURPOSE: compute the D-module structure of basering[f^s], according
+to the algorithm by Oaku and Takayama
 NOTE:    activate this ring with the @code{setring} command. In this ring,
 @*       - the ideal LD is the needed D-mod structure,