Software for multiplier ideals

TL;DR

This paper introduces a new software package that efficiently computes multiplier ideals for specific algebraic structures using combinatorial formulas and the Normaliz library, integrated into Macaulay2.

Contribution

The paper presents a novel software implementation that leverages combinatorial formulas to compute multiplier ideals for various algebraic objects within Macaulay2.

Findings

Successfully computes multiplier ideals for monomial ideals, curves, and determinantal ideals.

Utilizes combinatorial formulas from Howald, Thompson, and Johnson.

Integrates with Normaliz for efficient calculations.

Abstract

We describe a new software package for computing multiplier ideals in certain cases, including monomial ideals, monomial curves, generic determinantal ideals, and hyperplane arrangements. In these cases we take advantage of combinatorial formulas for multiplier ideals given by results of Howald, Thompson, and Johnson. The package uses Normaliz. It is available as a library for Macaulay2.