Minimal free resolutions of lattice ideals of digraphs

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/127012

Title:	Minimal free resolutions of lattice ideals of digraphs
Author:	O'Carroll, Liam; Planas Vilanova, Francesc d'Assís
Other authors:	Universitat Politècnica de Catalunya. Departament de Matemàtiques; Universitat Politècnica de Catalunya. GEOMVAP - Geometria de Varietats i Aplicacions
Abstract:	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.
Abstract:	Peer Reviewed
Subject(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística -Commutative algebra -Directed graph -lattice ideal -Gröbner basis -minimal free resolution -Àlgebra commutativa
Rights:	Attribution-NonCommercial-NoDerivs 3.0 Spain http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Document type:	Article - Submitted version Article
Share: