加载中…
2008-07-28
Algorithms for computing multiplier ideals
Takafumi Shibuta
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本