primaryDecomposition Ideal -- find a primary decomposition of an ideal

primaryDecomposition Ideal -- find a primary decomposition of an ideal

Synopsis:

Usage: L = primaryDecomposition I

Function: primaryDecomposition

Input:

I, an instance of class Ideal: an ideal in a (quotient of a) polynomial ring R.

Output:

L, an instance of class List: a list of primary ideals whose intersection is I.

Optional arguments :

primaryDecomposition(..., PrintLevel => ...)

primaryDecomposition(..., Strategy => ...) -- specify a computational strategy

This routine returns an irredundant primary decomposition for the ideal I. The specific algorithm used varies depending on the characteristics of the ideal, and can also be specified using the optional argument Strategy.

Give examples here.

Give references to algorithms used here.

Caveat:

put possible problems here. e.g. over QQ.

Authors: W. Decker, G. Smith, M. Stillman, C. Yackel.
Maintainer: C. Yackel cyackel@math.indiana.edu. Last modified June 2000.

See also:

ass Ideal -- find the associated primes of an ideal

radical -- compute the radical of an ideal

decompose -- irreducible components of an ideal

top -- compute the top dimensional components

removeLowestDimension -- remove components of lower dimension