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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.