Vol. 4, No. 1, 2012

Download this article
Download this article For screen
Recent Issues
Volume 7, Issue 1
Volume 6, Issue 1
Volume 5, Issue 1
Volume 4, Issue 1
Volume 3, Issue 1
Volume 2, Issue 1
Volume 1, Issue 1
The Journal
Cover
Editorial Board
Editors’ Addresses
About the Journal
Submission Guidelines
Submission Form
Editorial Login
Contacts
Decompositions of binomial ideals

Thomas Kahle

Vol. 4 (2012), 1–5
Abstract

The Macaulay2 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.

Mathematical Subject Classification 2010
Primary: 13P15
Secondary: 13C99
Supplementary material

Binomials source code

Milestones
Received: 28 June 2011
Revised: 22 September 2011
Accepted: 6 February 2012
Authors
Thomas Kahle
Forschungsinstitut für Mathematik
ETH Zürich
Office HG G 38.1
Rämistrasse 101
CH-8092 Zürich
Switzerland