✦ LIBER ✦

Computing minimal finite free resolutions

✍ Scribed by A. Capani; G. De Dominicis; G. Niesi; L. Robbiano

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 904 KB
Volume: 117-118
Category: Article
ISSN: 0022-4049
DOI: 10.1016/s0022-4049(97)00007-8

No coin nor oath required. For personal study only.

✦ Synopsis

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 G&i14 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. @ 1997 Elsevier Science B.V.

📜 SIMILAR VOLUMES

Remarks on the Computation of Minimal Fi

Remarks on the Computation of Minimal Finite Free Resolutions

✍ Francesca Cioffi 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 88 KB

Strategies for Computing Minimal Free Re

Strategies for Computing Minimal Free Resolutions

✍ R. La Scala; M. Stillman 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 503 KB

In the present paper we study algorithms based on the theory of Gröbner bases for computing free resolutions of modules over polynomial rings. We propose a technique which consists in the application of special selection strategies to the Schreyer algorithm. The resulting algorithm is efficient and,

Multigraded Betti numbers without comput

Multigraded Betti numbers without computing minimal free resolutions

✍ Eduardo Sáenz-de-Cabezón 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 216 KB

We use Mayer-Vietoris trees to obtain the multigraded Betti numbers of monomial ideals without computing their minimal free resolutions. This method provides not only a competitive algorithm for such computations but also a new tool for the analysis of the homological structure of monomial ideals. U

Constructive finite free resolutions

✍ Thierry Coquand; Claude Quitté 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 202 KB

Minimal Free Resolutions of HomogenizedD

Minimal Free Resolutions of HomogenizedD-modules

✍ Toshinori Oaku; Nobuki Takayama 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 330 KB

Homogenizing a module over the ring of differential operators, we define the notion of a minimal free resolution that is adapted to a filtration. We show that one can apply a modification of the algorithm of La Scala and Stillman to compute such a free resolution. By dehomogenization, one gets a fre

On minimal free resolutions of projectiv

On minimal free resolutions of projective varieties of degree = codimension + 2

✍ Le Tuan Hoa 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 497 KB