Algebraic Geometry Seminar
Anton Leykin
Georgia Tech
Algorithms for multiplier ideals
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)
Thursday February 11, 2010 at 4:00 PM in SEO 636