Minimal free resolutions of lattice ideals of digraphs
Commutative Algebra
2018-02-23 v2 Combinatorics
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.
Cite
@article{arxiv.1701.07990,
title = {Minimal free resolutions of lattice ideals of digraphs},
author = {Liam O'Carroll and Francesc Planas-Vilanova},
journal= {arXiv preprint arXiv:1701.07990},
year = {2018}
}
Comments
40 pages