English
Related papers

Related papers: Software for multiplier ideals

200 papers

Numerical Algebraic Geometry uses numerical data to describe algebraic varieties. It is based on the methods of numerical polynomial homotopy continuation, an alternative to the classical symbolic approaches of computational algebraic…

Algebraic Geometry · Mathematics 2011-11-23 Anton Leykin

In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters…

Commutative Algebra · Mathematics 2024-02-09 Luis A. Dupont , Humberto Muñoz-George , Rafael H. Villarreal

Symbolic powers are a classical commutative algebra topic that relates to primary decomposition, consisting, in some circumstances, of the functions that vanish up to a certain order on a given variety. However, these are notoriously…

Commutative Algebra · Mathematics 2019-10-16 Ben Drabkin , Eloísa Grifo , Alexandra Seceleanu , Branden Stone

We introduce the package LatticePolytopes for Macaulay2. The package provides methods for computations related to Cayley structures, local positivity and smoothness for lattice polytopes.

Algebraic Geometry · Mathematics 2015-11-11 Anders Lundman , Gustav Sædén Ståhl

We describe an algorithm for computing Macaulay dual spaces for multi-graded ideals. For homogeneous ideals, the natural grading is inherited by the Macaulay dual space which has been leveraged to develop algorithms to compute the Macaulay…

Commutative Algebra · Mathematics 2023-10-19 Joseph Cummings , Jonathan Hauenstein

We shortly describe the algorithms behind some of the functions provided by the Macaulay2 package MultiprojectiveVarieties, a package for multi-projective varieties and rational maps between them.

Algebraic Geometry · Mathematics 2022-03-09 Giovanni Staglianò

This paper describes the RationalMaps package for Macaulay2. This package provides functionality for computing several aspects of rational maps such as whether a map is birational, or a closed embedding.

Algebraic Geometry · Mathematics 2023-01-25 C. J. Bott , S. Hamid Hassanzadeh , Karl Schwede , Daniel Smolkin

The Package Miura contains functions that compute divisor class group arithmetic for nonsingular curves. The package reduces computation in a divisor class group to that in the ideal class group via the isomorphism. The underlying quotient…

Commutative Algebra · Mathematics 2015-12-29 Joe Suzuki

We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…

Combinatorics · Mathematics 2014-05-06 Jose Rodriguez

The Macaulay2 package Cremona performs some computations on rational and birational maps between irreducible projective varieties. For instance, it provides methods to compute degrees and projective degrees of rational maps without any…

Algebraic Geometry · Mathematics 2018-08-28 Giovanni Staglianò

With a particular focus on explicit computations and applications of the Koszul homology and Betti numbers of monomial ideals, the main goals of this thesis are the following: Analyze the Koszul homology of monomial ideals and apply it to…

Commutative Algebra · Mathematics 2008-03-05 Eduardo Saenz-de-Cabezon

This note describes a package for computing seminormalization of rings within Macaulay2.

Commutative Algebra · Mathematics 2020-02-12 Karl Schwede , Bernard Serbinowski

This article highlights the ToricHigherDirectImages package in Macaulay2. The central feature is a method for computing (higher) direct images of line bundles under surjective toric morphisms.

Algebraic Geometry · Mathematics 2025-05-30 Sasha Zotine

We describe the Macaulay2 package "A1BrouwerDegrees" for computing local and global $\mathbb{A}^1$-Brouwer degrees and studying symmetric bilinear forms over the complex numbers, the real numbers, the rational numbers, and finite fields of…

Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…

Discrete Mathematics · Computer Science 2020-05-18 Christopher Hojny , Marc E. Pfetsch , Matthias Walter

In this note we calculate the multiplier ideal associated to an arbitrary monomial ideal in C^n. We discuss applications to the calculation of log canonical thresholds.

Algebraic Geometry · Mathematics 2007-05-23 jason howald

We describe a Macaulay2 package for computing Schur complexes. This package expands on the ChainComplexOperations package by David Eisenbud.

We introduce the Brackets package for the computer algebra system Macaulay2, which provides convenient syntax for computations involving the classical invariants of the special linear group. We describe our implementation of bracket rings…

Algebraic Geometry · Mathematics 2025-04-02 Dalton Bidleman , Timothy Duff , Jack Kendrick , Michael Zeng

We present two novel applications of symmetries for mixed-integer linear programming. First we propose two variants of a new heuristic to improve the objective value of a feasible solution using symmetries. These heuristics can use either…

Optimization and Control · Mathematics 2014-08-19 Philipp M. Christophel , Menal Güzelsoy , Imre Pólik

We introduce the MatrixSchubert package for the computer algebra system Macaulay2. This package has tools to construct and study matrix Schubert varieties and alternating sign matrix (ASM) varieties. The package also introduces tools for…

Algebraic Geometry · Mathematics 2025-11-26 Ayah Almousa , Sean Grate , Daoji Huang , Patricia Klein , Adam LaClair , Yuyuan Luo , Joseph McDonough