Computing minimal finite free resolutions

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 firs...

Full description

Saved in:
Bibliographic Details
Published inJournal of pure and applied algebra Vol. 117; pp. 105 - 117
Main Authors Capani, A., De Dominicis, G., Niesi, G., Robbiano, L.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.05.1997
Subjects
13D40
13D02
13P10
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0022-4049
1873-1376
DOI:10.1016/S0022-4049(97)00007-8