Algorithms for computing multiplier ideals
Takafumi Shibuta · arXiv (Cornell University) · 2008
We give algorithms for computing multiplier ideals using Gröbner bases in Weyl algebras. The algorithms are based on a newly introduced notion which is a variant of Budur--Mustaţǎ--Saito's (generalized) Bernstein--Sato polynomial. We present several examples computed by our algorithms.