Algorithms for primary decomposition in SINGULAR

Grobner bases are the main computational tool available for algebraic geometry. Building on top of Grobner bases algorithms for ideal theoretical operations (intersection, quotient, saturation, free resolution,...) will be presented. Combining these algorithms with (multi-variate) factorization leads to several algorithms for primary decomposition of ideals.