Decompositions of Binomial Ideals in Macaulay 2

Abstract

The package Binomials contains implementations of specialized algorithms for binomial ideals, including primary decomposition into binomial ideals. The current implementation works in characteristic zero. Primary decomposition is restricted to binomial ideals with trivial coefficients to avoid computations over the algebraic numbers. The basic ideas of the algorithms go back to Eisenbud and Sturmfels' seminal paper on the subject. Two recent improvements of the algorithms are discussed and examples are presented.

This paper is supplementary to the source code available at www.thomas-kahle.de/bpd

Cited by in corpus (13)

• Decompositions of commutative monoid congruences and binomial ideals
• Detecting Binomiality
• Multigraded Commutative Algebra of Graph Decompositions
• Parity binomial edge ideals
• Positive margins and primary decomposition
• Eigenschemes and the Jordan canonical form
• Decompositions of Cellular Binomial Ideals
• Non-simple polyominoes of Kőnig type and their canonical module
• First-Order Tests for Toricity
• Binomial ideals and congruences on ${\mathbb{N}}^n$
• Parametric Toricity of Steady State Varieties of Reaction Networks
• 2 x 2 permanental ideals of hypermatrices
• s-Hankel hypermatrices and 2 x 2 determinantal ideals