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 language | American English |
---|---|
State | Published - 2 Aug 2013 |
Event | SIAM (Society for Industrial and Applied Mathematics) Conference on Applied Algebraic Geometry - Duration: 2 Aug 2013 → … |
Conference
Conference | SIAM (Society for Industrial and Applied Mathematics) Conference on Applied Algebraic Geometry |
---|---|
Period | 2/08/13 → … |
EGS Disciplines
- Mathematics