Computing the Betti table of a monomial ideal: a reduction algorithm

DOI10.1016/j.jsc.2017.06.001zbMath1390.13045OpenAlexW2626786191MaRDI QIDQ1690782

Matteo Varbaro, Maria-Laura Torrente

Publication date: 12 January 2018

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2017.06.001

zbMATH Keywords

minimal free resolutionmonomial idealsBetti tablessubadditivity property

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Syzygies, resolutions, complexes and commutative rings (13D02)

Related Items

On vanishing patterns in \(j\)-strands of edge ideals, Minimal cellular resolutions of the edge ideals of forests, Simplicial complexes of small codimension, Pruned cellular free resolutions of monomial ideals

Uses Software

• CoCoA
• Macaulay2
• SINGULAR

Cites Work

• Unnamed Item
• Unnamed Item
• Refined algorithms to compute syzygies
• A new explicit finite free resolution of ideals generated by monomials in an R-sequence
• Regularity 3 in edge ideals associated to bipartite graphs
• Characteristic-independence of Betti numbers of graph ideals
• Betti tables of \(p\)-Borel-fixed ideals
• Minimal free resolutions that are not supported by a CW-complex
• A note on the subadditivity problem for maximal shifts in free resolutions
• Minimal resolutions via algebraic discrete Morse theory
• Cellular resolutions of monomial modules
• Morse theory from an algebraic viewpoint