TY - JOUR
T1 - Algorithms for computing multiplier ideals
AU - Shibuta, Takafumi
N1 - Funding Information:
This research was supported by JST, CREST. The author thanks Shunsuke Takagi for useful comments and discussions. The author would also like to thank Naoyuki Shinohara and Kazuhiro Yokoyama for warm encouragement and support.
PY - 2011/12
Y1 - 2011/12
N2 - We give algorithms for computing multiplier ideals using Gröbner bases in Weyl algebras. To this end, we define a modification of Budur-MustaǍǎ-Saito's generalized Bernstein-Sato polynomial. We present several examples computed by our algorithm.
AB - We give algorithms for computing multiplier ideals using Gröbner bases in Weyl algebras. To this end, we define a modification of Budur-MustaǍǎ-Saito's generalized Bernstein-Sato polynomial. We present several examples computed by our algorithm.
UR - http://www.scopus.com/inward/record.url?scp=79959369643&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79959369643&partnerID=8YFLogxK
U2 - 10.1016/j.jpaa.2011.04.002
DO - 10.1016/j.jpaa.2011.04.002
M3 - Article
AN - SCOPUS:79959369643
SN - 0022-4049
VL - 215
SP - 2829
EP - 2842
JO - Journal of Pure and Applied Algebra
JF - Journal of Pure and Applied Algebra
IS - 12
ER -