Computing the Betti table of a monomial ideal: a reduction algorithm
type: Item
instance of: scholarly article
title: Computing the Betti table of a monomial ideal: a reduction algorithm
zbMATH Open document ID: 1390.13045
author: M.-L. Torrente
author: Matteo Varbaro
published in: Journal of Symbolic Computation
publication date: 2018-01-12T00:00:00Z
review text: Computing minimal free resolutions of ideals and their associated graded Betti numbers is a central theme of research in commutative algebra. In the paper under review, the authors introduce a new algorithm for computing the minimal free resolution of an arbitrary monomial ideal. They demonstrate that their algorithm is more efficient than others currently built into Macaulay 2 and CoCoA (see Table 1). In Theorem 6.2, this algorithm is applied to extend a result of \textit{J. Herzog} and \textit{H. Srinivasan} [Math. Sci. Res. Inst. Publ. 68, 245--249 (2015; Zbl 1359.13012)]: for an ideal \(I\) generated by monomials of degree at most \(d\) \[ \beta_{i,k} (S/I)= 0 \text{ for all } k = j, \dots, j+d-1 \quad \Longrightarrow \quad \beta_{i+1,j+d}(S/I) = 0. \] That is, if the Betti table of \(I\) has \(d\) 0's in a column of the Betti table, an entry of the next column of its Betti table is also 0. To make their work more readable, the authors present a preliminary algorithm incorporating the key ideas of their main algorithm that they later refine. Given a monomial ideal \(I\), the preliminary algorithm begins with the (not necessarily minimal) Lyubeznik resolution of \(I\) and a directed graph \(G(I)\) associated with \(I\). The graph \(G(I)\) is then changed via a reduction procedure on its invertible edges. As the graph changes, corresponding changes take place in the resolution according to a result of \textit{M. Jöllenbeck} and \textit{V. Welker} [Mem. Am. Math. Soc. 923, 74 p. (2009; Zbl 1160.13007)] from algebraic discrete Morse theory. When the reduction procedure can no longer be applied to \(G(I)\) the corresponding resolution is a minimal free resolution of \(I\). The preliminary algorithm is made more efficient by ignoring maps of the resolution (considering only Betti tables), ordering the edges of \(G(I)\), only considering invertible edges of \(G(I)\), and building up the Lyubeznik resolution step-by-step rather than constructing it at the beginning. The…
reviewed by: Sarah Mayes-Tang
Mathematics Subject Classification ID: 13D02
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 6825751
zbMATH Keywords: Betti tables
zbMATH Keywords: monomial ideals
zbMATH Keywords: subadditivity property
zbMATH Keywords: minimal free resolution
describes a project that uses: CoCoA
describes a project that uses: SINGULAR
describes a project that uses: Macaulay2
MaRDI profile type: Publication
full work available at URL: j.jsc.2017.06.001
OpenAlex ID: W2626786191
cites work: Cellular resolutions of monomial modules
cites work: Betti tables of \(p\)-Borel-fixed ideals
cites work: Q4317713
cites work: Refined algorithms to compute syzygies
cites work: Regularity 3 in edge ideals associated to bipartite graphs
cites work: Q4783713
cites work: Minimal resolutions via algebraic discrete Morse theory
cites work: A note on the subadditivity problem for maximal shifts in free resolutions
cites work: Characteristic-independence of Betti numbers of graph ideals
cites work: A new explicit finite free resolution of ideals generated by monomials in an R-sequence
cites work: Morse theory from an algebraic viewpoint
cites work: Minimal free resolutions that are not supported by a CW-complex
DOI: 10.1016/J.JSC.2017.06.001
description: scientific article; zbMATH DE number 6825751