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.

We investigate symbolic and regular powers of monomial ideals. For a square-free monomial ideal I ⊆ 𝕜[x₀, … , x_n] we show that for all positive integers m, t and r, where e is the big-height of I and . This captures two conjectures (r = 1 and r = e): one of Harbourne and Huneke, and one of Bocci et al. We also introduce the symbolic polyhedron of a monomial ideal and use this to explore symbolic powers of non-square-free monomial ideals.