@inproceedings{3c1ca1eeac2144029ec7f0a349aa8b95,

title = "Algorithms for Bernstein-Sato polynomials and multiplier ideals",

abstract = "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 providing a survey of known 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-Musta{\c C}{\^a}-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.",

keywords = "Bernstein-Sato polynomial, D-modules, Jumping coefficients, Log-canonical threshold, Multiplier ideals, V-filtration",

author = "Christine Berkesch and Anton Leykin",

year = "2010",

doi = "10.1145/1837934.1837958",

language = "English (US)",

isbn = "9781450301503",

series = "Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC",

publisher = "Association for Computing Machinery (ACM)",

pages = "99--106",

booktitle = "Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC 2010",

address = "United States",

note = "2010 International Symposium on Symbolic and Algebraic Computation, ISSAC 2010 ; Conference date: 25-07-2010 Through 28-07-2010",

}