Computing the support of monomial iterated mapping cones
From MaRDI portal
Publication:992802
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
Cites work
- A new explicit finite free resolution of ideals generated by monomials in an R-sequence
- Betti numbers and minimal free resolutions for multi-state system reliability bounds
- Betti numbers of some monomial ideals
- Computation of Hilbert functions
- Computation of Hilbert-Poincaré series
- Computation of the \((n-1)\)-st Koszul homology of monomial ideals and related algorithms
- Minimal Free Resolutions of Complete Bipartite Graph Ideals
- Minimal resolutions of some monomial ideals
- Multigraded Betti numbers without computing minimal free resolutions
- Resolutions by mapping cones
- Resolutions obtained by iterated mapping cones
- Resolutions of small sets of fat points
- Reverse search for monomial ideals
- Saturation and Castelnuovo-Mumford regularity
- The slice algorithm for irreducible decomposition of monomial ideals
Cited in
(8)- Reverse search for monomial ideals
- Computation of cones of generalized supporting functionals
- Mayer-Vietoris trees of monomial ideals
- Multigraded Betti numbers without computing minimal free resolutions
- Mincut ideals of two-terminal networks
- Computation of the \((n-1)\)-st Koszul homology of monomial ideals and related algorithms
- Monomial iterated mapping cones
- Computing the Betti table of a monomial ideal: a reduction algorithm
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)
