Splittings of monomial ideals
Preprint
Abstract
We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire's splitting approach. As applications, we show that edge ideals of graphs are splittable, and we provide an iterative method for computing the Betti numbers of the cover ideals of Cohen-Macaulay bipartite graphs. Finally, we consider the frequency with which one can find particular splittings of monomial ideals and raise questions about ideals whose resolutions are characteristic-dependent.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Regularity, depth and arithmetic rank of bipartite edge idealsJournal of Algebraic Combinatorics, 2009
- Whiskers and sequentially Cohen–Macaulay graphsJournal of Combinatorial Theory, Series A, 2008
- Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbersJournal of Algebraic Combinatorics, 2007
- Splittable ideals and the resolutions of monomial idealsJournal of Algebra, 2007
- Characteristic-independence of Betti numbers of graph idealsJournal of Combinatorial Theory, Series A, 2006
- Resolutions of small sets of fat pointsJournal of Pure and Applied Algebra, 2005
- Distributive Lattices, Bipartite Graphs and Alexander DualityJournal of Algebraic Combinatorics, 2005
- On the Resolution of Ideals of Fat PointsJournal of Algebra, 2001
- Cohen-macaulay graphsmanuscripta mathematica, 1990
- Minimal resolutions of some monomial idealsJournal of Algebra, 1990