D.4.27 primdecint_lib

Library:

primdecint.lib

Purpose:

primary decomposition of an ideal in the polynomial ring over the integers

Authors:

G. Pfister [email protected]
A. Sadiq [email protected]
S. Steidel [email protected]

Overview:

A library for computing the primary decomposition of an ideal in the polynomial ring over the integers, Z[x_1,...,x_n].
The first procedure 'primdecZ' can be used in parallel. The coefficients must always be ZZ.

Reference: Pfister, Sadiq, Steidel , "An Algorithm for primary decomposition in polynomial rings over the integers" , arXiv:1008.2074

Procedures:

D.4.27.1 primdecZ		compute the primary decomposition of ideal I
D.4.27.2 primdecZM		compute the primary decomposition of module I
D.4.27.3 minAssZ		compute the minimal associated primes of I
D.4.27.4 radicalZ		compute the radical of I
D.4.27.5 heightZ		compute the height of I
D.4.27.6 equidimZ		compute the equidimensional part of I
D.4.27.7 intersectZ		compute the intersection of I and J