Anton Leykin : Algorithms for multiplier ideals

Posted by , part of the Algebraic Geometry Seminar.

At

Feb. 11, 2010, 4 p.m.

In

SEO 636

Abstract

We develop new algorithms to compute generalized Bernstein--Sato polynomials of Budur--Mustata--Saito and Shibuta for an arbitrary variety. These lead to computations of log canonical thresholds, jumping coefficients, and multiplier ideals. The algorithms have been implemented in the D-modules package of the computer algebra system Macaulay2. (Joint work with Christine Berkesch)