Divisors on graphs, orientations, syzygies, and system reliability

From MaRDI portal
Publication:256549

DOI10.1007/S10801-015-0641-YzbMATH Open1331.05122arXiv1405.7972OpenAlexW1843028771MaRDI QIDQ256549FDOQ256549


Authors: Fatemeh Mohammadi Edit this on Wikidata


Publication date: 9 March 2016

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: We study various ideals arising in the theory of system reliability. We use ideas from the theory of divisors, orientations and matroids on graphs to describe the minimal polyhedral cellular free resolutions of these ideals. In each case we give an explicit combinatorial description of the minimal generating set for each higher syzygy module in terms of the acyclic orientations of the graph, the q-reduced divisors and the bounded regions of the graphic hyperplane arrangement. The resolutions of all these ideals are closely related, and their Betti numbers are independent of the characteristic of the base field. We apply these results to compute the reliability of their associated coherent systems.


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




Recommendations




Cites Work


Cited In (11)





This page was built for publication: Divisors on graphs, orientations, syzygies, and system reliability

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