When Is a Graded Free Complex Exact?

Minimal free resolutions of a finitely generated module over a polynomial ring S = k [ x ] , with variables x = { x 1 , … , x n } and a field k have been extensively studied. Almost all the results in the literature about minimal free resolutions give their Betti numbers, that is, the ranks of the free modules in the resolution at each degree. Several techniques have been developed to compute Betti numbers, making this a manageable problem in many cases. However, a description of the differentials in the resolution is rarely given, as this turns out to be a more difficult problem. The main purpose of this article is to give a criterion to check when a graded free complex of an S -module is exact. Unlike previous similar criteria, this one allows us to give a description of the differentials using the combinatorics of the S -module. The criterion is given in terms of the Betti numbers of the resolutions in each degree and the set of columns of the matrix representation of the differentials. In the last section, and with the aim of illustrating how to use the criterion, we apply it to one of the first better-understood cases, the edge ideal of the complete graph. However, this criterion can be used to give an explicit description of the differentials of a resolution of several monomial ideals such as the duplication of an ideal, the edge ideal of a cograph, etc.