Algorithms for computing multiplier ideals
Algebraic Geometry
2010-01-30 v6 Commutative Algebra
Abstract
We give algorithms for computing multiplier ideals using Gr\"obner bases in Weyl algebras. The algorithms are based on a newly introduced notion which is a variant of Budur--Musta\c{t}\v{a}--Saito's (generalized) Bernstein--Sato polynomial. We present several examples computed by our algorithms.
Cite
@article{arxiv.0807.4302,
title = {Algorithms for computing multiplier ideals},
author = {Takafumi Shibuta},
journal= {arXiv preprint arXiv:0807.4302},
year = {2010}
}
Comments
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)