Minimal free resolutions of lattice ideals of digraphs
Rights accessOpen Access
Based upon a previous work of Manjunath and Sturmfels for a finite, complete, undirected graph, and a refined algorithm by Eröcal, Motsak, Schreyer and Steenpaß for computing syzygies, we display a free resolution of the lattice ideal associated to a finite, strongly connected, weighted, directed graph. Moreover, the resolution is minimal precisely when the digraph is strongly complete.
CitationO'Carroll, L., Planas-Vilanova, F. A. Minimal free resolutions of lattice ideals of digraphs. "ALGEBRAIC COMBINATORICS", 2 Març 2018, vol. 1, núm. 2, p. 283-326.