Minimal free resolutions of lattice ideals of digraphs
classification
🧮 math.AC
math.CO
keywords
completefinitefreegraphlatticeminimalresolutionstrongly
read the original 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{\ss} 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.