Rank three matroids are Rayleigh
David G. Wagner

TL;DR
This paper proves that all matroids of rank three satisfy Rayleigh inequalities, extending the Rayleigh property from electrical networks to a broader class of matroids.
Contribution
It establishes that every rank three matroid inherently satisfies Rayleigh inequalities, a property previously studied mainly in electrical network contexts.
Findings
All rank three matroids satisfy Rayleigh inequalities.
Rayleigh property extends beyond electrical networks to matroids.
Provides a new class of matroids with Rayleigh property.
Abstract
A Rayleigh matroid is one which satisfies a set of inequalities analogous to the Rayleigh monotonicity property of linear resistive electrical networks. We show that every matroid of rank three satisfies these inequalities.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Interconnection Networks and Systems · Advanced Graph Theory Research
