Computing minimal finite free resolutions Original Research Article

In this paper we address the basic problem of computing minimal finite free resolutions of homogeneous submodules of graded free modules over polynomial rings. We develop a strategy, which keeps the resolution minimal at every step. Among the relevant benefits is a marked saving of time, as the first reported experiments in CoCoA show. The algorithm has been optimized using a variety of techniques, such as minimizing the number of critical pairs and employing an “ad hoc” Hilbert-driven strategy. The algorithm can also take advantage of various a priori pieces of information, such as the knowledge of the Castelnuovo regularity.