Computing minimal finite free resolutions

被引：13

作者：

Capani, A

DeDominicis, G

Niesi, G

Robbiano, L

机构：

[1] UNIV GENOA,DIPARTIMENTO SCI INFORMAZ,GENOA,ITALY

[2] UNIV GENOA,DIPARTIMENTO MATEMAT,GENOA,ITALY

来源：

JOURNAL OF PURE AND APPLIED ALGEBRA | 1997年 / 117卷

关键词：

D O I：

10.1016/S0022-4049(97)00007-8

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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. (C) 1997 Elsevier Science B.V.

引用

页码：105 / 117

页数：13