Home Online Manual
Back: ratSol
Forward: annRatSyz
FastBack: ratgb_lib
FastForward: Examples
Up: dmodloc_lib
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document bfctBound
Procedure from library dmodloc.lib (see dmodloc_lib).

bfctBound (I,f[,primdec]); I ideal, f poly, primdec optional string

The basering is the n-th Weyl algebra W over a field of characteristic 0 and for all 1<=i<=n the identity
var(i+n)*var(i)=var(i)*var(i+1)+1 holds, i.e. the sequence of variables is given by x(1),...,x(n),D(1),...,D(n), where D(i) is the differential operator belonging to x(i).
Moreover, assume that I is holonomic.

list of roots (of type ideal) and multiplicities (of type intvec) of a multiple of the b-function for f^s*u at a generic root of f. Here, u stands for [1] in D/I.

Reference: (OTT), Algorithm 3.4

This procedure requires to compute a primary decomposition in a commutative ring. The optional string primdec can be used to specify the algorithm to do so. It may either be `GTZ' (Gianni, Trager, Zacharias) or `SY' (Shimoyama, Yokoyama). By default, `GTZ' is used.
If printlevel=1, progress debug messages will be printed, if printlevel>=2, all the debug messages will be printed.

LIB "dmodloc.lib";
ring r = 0,(x,y,Dx,Dy),dp;
def W = Weyl();
setring W;
poly tx,ty = x*Dx, y*Dy;
ideal I =      // Appel F1 with parameters (2,-3,-2,5)
kill tx,ty;
poly f = x-1;
==> [1]:
==>    _[1]=-1
==>    _[2]=-7
==> [2]:
==>    1,1
See also: bernstein; bfct; bfctAnn.