𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Multigraded Betti numbers without computing minimal free resolutions

✍ Scribed by Eduardo Sáenz-de-Cabezón

Publisher
Springer
Year
2009
Tongue
English
Weight
216 KB
Volume
20
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.

✦ Synopsis

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. Using Mayer-Vietoris trees we obtain new results for several families of monomial ideals and new proofs of known results for other families.

📜 SIMILAR VOLUMES

Computing minimal finite free resolution
Computing minimal finite free resolutions
✍ A. Capani; G. De Dominicis; G. Niesi; L. Robbiano 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 904 KB

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 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,