Algorithms for computing multiplier ideals

Abstract

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.

23 pages, title changed, Theorem 4.5 added, typos corrected, and some minor revisions (some notation changed, and Definition 2.1, Proposition 2.11, Observation 3.1, and Observation 4.2 added)

References in corpus (1)

• Multiplier Ideals of Sufficiently General Polynomials

Cited by in corpus (3)

• Constructive $D$-module Theory with \textsc{Singular}
• Effective Methods for the Computation of Bernstein-Sato polynomials for Hypersurfaces and Affine Varieties
• Log canonical thresholds of binomial ideals