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
Strategies for Computing Minimal Free Resolutions
β Scribed by R. La Scala; M. Stillman
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 503 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
β¦ Synopsis
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, in the graded case, allows a straightforward minimalization algorithm. These techniques generalize to factor rings, skew commutative rings, and some non-commutative rings. Finally, the proposed approach is compared with other algorithms by means of an implementation developed in the new system Macaulay2.
π SIMILAR VOLUMES
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
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