Computing the Betti table of a monomial ideal: a reduction algorithm
From MaRDI portal
Recommendations
- Computing the support of monomial iterated mapping cones
- The slice algorithm for irreducible decomposition of monomial ideals
- Multigraded Betti numbers without computing minimal free resolutions
- Betti numbers of some monomial ideals
- Computation of Betti numbers of monomial ideals associated with cyclic polytopes
Cites work
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 1842473 (Why is no real title available?)
- A new explicit finite free resolution of ideals generated by monomials in an R-sequence
- A note on the subadditivity problem for maximal shifts in free resolutions
- Betti tables of \(p\)-Borel-fixed ideals
- Cellular resolutions of monomial modules
- Characteristic-independence of Betti numbers of graph ideals
- Minimal free resolutions that are not supported by a CW-complex
- Minimal resolutions via algebraic discrete Morse theory
- Morse theory from an algebraic viewpoint
- Refined algorithms to compute syzygies
- Regularity 3 in edge ideals associated to bipartite graphs
Cited in
(10)- Pruned cellular free resolutions of monomial ideals
- Minimal cellular resolutions of the edge ideals of forests
- Computing the support of monomial iterated mapping cones
- On the Golod property of Stanley-Reisner rings
- Minimal resolutions via algebraic discrete Morse theory
- On the free resolution induced by a Pommaret basis
- Minimal free resolutions of linear edge ideals
- Monomial iterated mapping cones
- On vanishing patterns in \(j\)-strands of edge ideals
- Simplicial complexes of small codimension
This page was built for publication: Computing the Betti table of a monomial ideal: a reduction algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690782)
