next
|
previous
|
forward
|
backward
| up |
top
|
index
|
toc
|
Macaulay2 web site
Binomials
::
binomialPrimaryDecomposition
binomialPrimaryDecomposition -- Binomial Primary Decomposition
Synopsis
Usage:
binomialPrimaryDecomposition I
Inputs:
I
, a binomial ideal
Optional inputs
:
Verbose => ...
, -- generate informative output
Outputs:
a list of binomial primary components of I
Description
This routine returns a minimal primary decomposition of a binomial ideal into binomial ideals.
R = QQ[x,y,z]
I = ideal (x*y-z, x*z-y^2)
bpd = binomialPrimaryDecomposition I
intersect bpd == I
A synonym for this function is
BPD
.
Caveat
Note that if the coefficient field needs to be extended, strange things can happen
See also
BPD
-- Binomial Primary Decomposition
Ways to use
binomialPrimaryDecomposition
:
binomialPrimaryDecomposition(Ideal)