arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0807.4302math.AGmath.AC
收藏

Algorithms for computing multiplier ideals

Takafumi Shibuta

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑