Algorithms for Bernstein-Sato polynomials and multiplier ideals

Details Algorithms for Bernstein-Sato polynomials and multiplier ideals Algorithms for Bernstein-Sato polynomials and multiplier ideals

2010-02-07

arxiv.org/abs/1002.1475v2

Mathematics

Algebraic Geometry

16 pages, to appear in ISSAC 2010

Scientific paper

The Bernstein-Sato polynomial (or global b-function) is an important invariant in singularity theory, which can be computed using symbolic methods in the theory of D-modules. After surveying algorithms for computing the global b-function, we develop a new method to compute the local b-function for a single polynomial. We then develop algorithms that compute generalized Bernstein-Sato polynomials of Budur-Mustata-Saito and Shibuta for an arbitrary polynomial ideal. These lead to computations of log canonical thresholds, jumping coefficients, and multiplier ideals. Our algorithm for multiplier ideals simplifies that of Shibuta and shares a common subroutine with our local b-function algorithm. The algorithms we present have been implemented in the D-modules package of the computer algebra system Macaulay2.

Affiliated with

Also associated with

No associations

Rating

Algorithms for Bernstein-Sato polynomials and multiplier ideals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithms for Bernstein-Sato polynomials and multiplier ideals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for Bernstein-Sato polynomials and multiplier ideals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-582830