Splittable ideals and the resolutions of monomial ideals

From MaRDI portal



Abstract: We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with fuller generality, and at the same time, obtain new results. Past investigations on the resolutions of edge ideals usually reduced the problem to computing the dimensions of reduced homology or Koszul homology groups. Our approach circumvents the highly nontrivial problem of computing the dimensions of these groups and turns the problem into combinatorial questions about the associated simple graph. We also show that our technique extends successfully to the study of graded Betti numbers of arbitrary square-free monomial ideals viewed as facet ideals of simplicial complexes.


A monomial ideal \(I\) is splittable if there exist two monomial ideals \(J\) and \(K\) such that \(I = J+K\) and the generators of \(J \cap K\) satisfy certain technical conditions. This notion was introduced by \textit{S. Eliahou} and \textit{M. Kervaire} [J. Algebra 129, No. 1, 1--25 (1990; Zbl 0701.13006)]. The main result of this paper is a recursive like formula for the graded Betti numbers of splittable edge ideals of graphs. This formula unifies all known results on the resolution of edge ideals of forests and allows the authors to obtain new results on the projective dimension and the regularity of edge ideals. The methods developed in this paper can be also used to study the graded Betti numbers of facet ideals of simplicial complexes.




Cited in
(51)


Describes a project that uses

Uses Software






This page was built for publication: Splittable ideals and the resolutions of monomial ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875092)