Minimal free resolutions of lattice ideals of digraphs (Q1637378)

Let \(I(\mathcal L)=\langle x^{m^+}-x^{m^-}| m \in \mathcal L\rangle \subset K[x]\), \(x=(x_1,\ldots,x_n)\), be the lattice ideal associated to the lattice \(\mathcal L\) spanned by the columns of the Laplacian matrix \(L\) of a finite, strongly connected, weighted, directed graph \(G\). A free resolution of \(I(\mathcal L)\) is computed. It is proved that this resolution is minimal if and only it \(G\) is strongly complete.