Minimal free resolutions of lattice ideals of digraphs
Abstract
Based upon a previous work of Manjunath and Sturmfels for a finite, complete, undirected graph, and a refined algorithm by Er\"ocal, 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.