arXiv · 1106.5968
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Thomas Kahle. 2011-06-29. Decompositions of Binomial Ideals in Macaulay 2. https://doi.org/10.2140/jsag.2012.4.1
Cite the original work for its findings. Save a collection to share your selection of sources.