Decompositions of Binomial Ideals in Macaulay 2

Details Decompositions of Binomial Ideals in Macaulay 2 Decompositions of Binomial Ideals in Macaulay 2

2011-06-29

arxiv.org/abs/1106.5968v1

JSAG 4 (2012) p 1--5

Mathematics

Commutative Algebra

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

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Decompositions of Binomial Ideals in Macaulay 2 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decompositions of Binomial Ideals in Macaulay 2, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decompositions of Binomial Ideals in Macaulay 2 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-359682