next | previous | forward | backward | up | top | index | toc | Macaulay2 web site
Binomials :: binomialPrimaryDecomposition

binomialPrimaryDecomposition -- Binomial Primary Decomposition

Synopsis

Description

This routine returns a minimal primary decomposition of a binomial ideal into binomial ideals.
i1 : R = QQ[x,y,z]

o1 = R

o1 : PolynomialRing
i2 : I = ideal (x*y-z, x*z-y^2)

                        2
o2 = ideal (x*y - z, - y  + x*z)

o2 : Ideal of R
i3 : bpd = binomialPrimaryDecomposition I

              2                  2
o3 = {ideal (y  - x*z, x*y - z, x  - y), ideal (z, y)}

o3 : List
i4 : intersect bpd == I

o4 = true
A synonym for this function is BPD.

Caveat

Note that if the coefficient field needs to be extended, strange things can happen

See also

Ways to use binomialPrimaryDecomposition :