Computing the support of monomial iterated mapping cones
Let \(I=\langle f_1,\dots,f_r\rangle\subseteq \mathbb{K}[x_1,\dots,x_n]\) and let \(I_i=\langle f_1,\dots,f_i\rangle\) be the subideal of \(I\) generated by the first \(i\) generators of \(I\). The following short exact sequence \[ 0\rightarrow \overline{I}_i \overset{\varphi}{\rightarrow} I_{i-1}\oplus \langle f_i\rangle \overset{i}{\rightarrow} I_i\rightarrow 0 \] is defined as Mayer-Vietoris sequence, where \(\overline{I}_i=I_{i-1}\cap \langle f_i\rangle\). In this paper the author constructs the corresponding Mayer-Vietoris tree, in order to study the monomial iterated mapping cones. By constructing this tree the author succeeds in computing the monomial support of a free resolution of a monomial ideal, avoiding the hard computation of the resolution itself. Moreover by this approach algorithms are provided to analyze this support to obtain homological and numerical invariants of a monomial ideal, such as Betti numbers, Hilbert series, irreducible decompositions, regularity and Euler characteristic of simplicial complexes. It is also worth mentioning that the author in the last section of the article, concludes in the effectiveness of the Mayer-Vietoris tree, by comparing it with other commonly used computer algebras systems, such as CoCoA, Singular, and Macaulay2.
- 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
- 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
- Computation of cones of generalized supporting functionals
- 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
- Monomial iterated mapping cones
- Mayer-Vietoris trees of monomial ideals
- Mincut ideals of two-terminal networks
- Reverse search for monomial ideals
- Multigraded Betti numbers without computing minimal free resolutions
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)
