Software for Computing Multiplier Ideals

Research output: Contribution to conferencePresentation

Abstract

Multiplier ideals are interesting for a range of applications in birational geometry, commutative algebra, and algebraic statistics. Unfortunately they are usually hard to compute. Shibuta’s algorithm, implemented in a Macaulay2 package by Christine Berkesch and Anton Leykin, can compute multiplier ideals of modestly sized examples. I describe a Macaulay2 package being developed that uses combinatorial algorithms for particular classes of ideals including monomial ideals, monomial curves, and determinantal ideals, allowing computations of somewhat larger examples.

Original languageAmerican English
StatePublished - 2 Aug 2013
EventSIAM (Society for Industrial and Applied Mathematics) Conference on Applied Algebraic Geometry -
Duration: 2 Aug 2013 → …

Conference

ConferenceSIAM (Society for Industrial and Applied Mathematics) Conference on Applied Algebraic Geometry
Period2/08/13 → …

EGS Disciplines

  • Mathematics

Fingerprint

Dive into the research topics of 'Software for Computing Multiplier Ideals'. Together they form a unique fingerprint.

Cite this