Divisors on graphs, binomial and monomial ideals, and cellular resolutions

From MaRDI portal
Publication:284775

DOI10.1007/S00209-015-1589-2zbMATH Open1336.05060arXiv1306.5351OpenAlexW3105075611MaRDI QIDQ284775FDOQ284775


Authors: Fatemeh Mohammadi, Farbod Shokrieh Edit this on Wikidata


Publication date: 18 May 2016

Published in: Mathematische Zeitschrift (Search for Journal in Brave)

Abstract: We study various binomial and monomial ideals arising in the theory of divisors, orientations, and matroids on graphs. We use ideas from potential theory on graphs and from the theory of Delaunay decompositions for lattices to describe their minimal polyhedral cellular free resolutions. We show that the resolutions of all these ideals are closely related and that their mathbbZ-graded Betti tables coincide. As corollaries, we give conceptual proofs of conjectures and questions posed by Postnikov and Shapiro, by Manjunath and Sturmfels, and by Perkinson, Perlman, and Wilmes. Various other results related to the theory of chip-firing games on graphs also follow from our general techniques and results.


Full work available at URL: https://arxiv.org/abs/1306.5351




Recommendations




Cites Work


Cited In (20)

Uses Software





This page was built for publication: Divisors on graphs, binomial and monomial ideals, and cellular resolutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284775)