On the reliability roots of simplicial complexes and matroids
From MaRDI portal
Publication:2319721
DOI10.1016/j.disc.2019.05.002zbMath1418.05133arXiv1809.10779OpenAlexW2949500475WikidataQ127823710 ScholiaQ127823710MaRDI QIDQ2319721
Jason I. Brown, C. D. C. DeGagné
Publication date: 20 August 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.10779
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of simplicial complexes (05E45)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pure \(O\)-sequences and matroid \(h\)-vectors
- On the structure of the \(h\)-vector of a paving matroid
- The Brown-Colbourn conjecture on zeros of reliability polynomials is false
- What can be said about pure O-sequences?
- Reliability polynomials and their asymptotic limits for families of graphs
- Combinatorics and commutative algebra.
- On the roots of all-terminal reliability polynomials
- Shorter Notes: The Roots of a Polynomial Vary Continuously as a Function of the Coefficients
- Large Roots Yield Large Coefficients: An Addendum to `The Roots of a Polynomial vary Continuously as a Function of the Coefficients'
- A Set System Polynomial with Colouring and Reliability Applications
- An Extension of the Eneström-Kakeya Theorem and Its Sharpness
- Roots of the Reliability Polynomials
- Zeros of Reliability Polynomials and f-vectors of Matroids
- Reliable circuits using less reliable relays
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
This page was built for publication: On the reliability roots of simplicial complexes and matroids
