Algorithms for primary decomposition in Singular

Abstract

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