arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1002.1475math.AGmath.AC
收藏

Bernstein-Sato多项式和乘子理想的算法

Algorithms for Bernstein-Sato polynomials and multiplier ideals

Christine Berkesch, Anton Leykin

摘要:

Bernstein-Sato多项式(或整体b-函数)是奇点理论中的一个重要不变量,它可以用D-模理论中的符号方法计算。在研究了全局b函数的计算方法之后,我们提出了一种新的方法来计算单个多项式的局部b函数。然后,我们开发的算法,计算广义伯恩斯坦-佐藤多项式的Budur-Mustata-齐藤和涩田任意多项式理想。这些导致对数典型阈值,跳跃系数和乘数理想的计算。我们的乘子理想算法简化了涩田和共享一个共同的子程序与我们的本地b-函数算法。我们提出的算法已经在计算机代数系统Macaulay 2的D-模块包中实现。

英文摘要:

The Bernstein-Sato polynomial (or global b-function) is an important invariant in singularity theory, which can be computed using symbolic methods in the theory of D-modules. After surveying algorithms for computing the global b-function, we develop a new method to compute the local b-function for a single polynomial. We then develop algorithms that compute generalized Bernstein-Sato polynomials of Budur-Mustata-Saito and Shibuta for an arbitrary polynomial ideal. These lead to computations of log canonical thresholds, jumping coefficients, and multiplier ideals. Our algorithm for multiplier ideals simplifies that of Shibuta and shares a common subroutine with our local b-function algorithm. The algorithms we present have been implemented in the D-modules package of the computer algebra system Macaulay2.

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

↑