next | previous | forward | backward | up | top | index | toc | Macaulay2 website
Binomials :: binomialMinimalPrimes

binomialMinimalPrimes -- minimal primes of a binomial Ideal

Synopsis

Description

The binomial minimal primes of a binomial ideal over QQ exist only in extension fields.
i1 : R = QQ[x,y,z]

o1 = R

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

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

o2 : Ideal of R
i3 : binomialMinimalPrimes I

o3 = {ideal (y, x)}

o3 : List
If the option Verbose is set (default), then output about the number of components found so far will be generated.

See also

Ways to use binomialMinimalPrimes :

For the programmer

The object binomialMinimalPrimes is a method function with options.