Minimal resolutions of lattice ideals and integer linear programming (Q1884028)

Let \({\mathcal L} \subseteq {\mathbb Z}^n\) be a lattice and \(I_{\mathcal L}\) be the lattice ideal associated with \({\mathcal L}\), i.e. the ideal of the polynomial ring \(k[x] = k[x_1, \dots, x_n]\) generated by the binomials \(x^{u^+}-x^{u^-}, \;u \in {\mathcal L}\) (where \(u = {u^+} - {u^-}\), \({u^+}, {u^-} \in {\mathbb N}^n\) with disjoint support). The authors show in which way the construction of the minimal free resolution of \(k[x_1, \dots, x_n]/I_{\mathcal L}\) is connected with integer linear programming. The key point is the computation of the non null reduced homology spaces of some simplicial complexes. Most of the results of the paper are obtained collecting the results already present in the vast literature on the subject; in this sense the paper is mostly a survey article.