Computing the support of monomial iterated mapping cones
DOI10.1016/J.JSC.2010.06.001zbMATH Open1277.13011OpenAlexW2062250216WikidataQ60246187 ScholiaQ60246187MaRDI QIDQ992802FDOQ992802
Publication date: 10 September 2010
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2010.06.001
Recommendations
- Monomial iterated mapping cones
- Computing the Betti table of a monomial ideal: a reduction algorithm
- Computation of the \((n-1)\)-st Koszul homology of monomial ideals and related algorithms
- The slice algorithm for irreducible decomposition of monomial ideals
- A slice algorithm for corners and Hilbert-Poincaré series of monomial ideals
Syzygies, resolutions, complexes and commutative rings (13D02) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Computational homological algebra (13P20)
Cites Work
- Resolutions of small sets of fat points
- Betti numbers of some monomial ideals
- Minimal resolutions of some monomial ideals
- Resolutions by mapping cones
- Saturation and Castelnuovo-Mumford regularity
- Computation of Hilbert functions
- Betti numbers and minimal free resolutions for multi-state system reliability bounds
- Resolutions obtained by iterated mapping cones
- Multigraded Betti numbers without computing minimal free resolutions
- The slice algorithm for irreducible decomposition of monomial ideals
- A new explicit finite free resolution of ideals generated by monomials in an R-sequence
- Computation of Hilbert-Poincaré series
- Reverse search for monomial ideals
- Computation of the \((n-1)\)-st Koszul homology of monomial ideals and related algorithms
- Minimal Free Resolutions of Complete Bipartite Graph Ideals
Cited In (3)
Uses Software
This page was built for publication: Computing the support of monomial iterated mapping cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992802)
