arXiv · 0807.4302
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.
Explore related subjects
Keep this discovery
Takafumi Shibuta. 2010-01-30. Algorithms for computing multiplier ideals. https://arxiv.org/abs/0807.4302
Cite the original work for its findings. Save a collection to share your selection of sources.