Matroid inequalities from electrical network theory

zbMath1060.05016MaRDI QIDQ1773143

David G. Wagner

Publication date: 25 April 2005

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/124416

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

polynomialsAleksandrov-Fenchel inequalitiesStanley's theorem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial inequalities (05A20) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (8)

Matroids arising from electrical networks ⋮ Matroids on Eight Elements with the Half-Plane Property and Related Concepts ⋮ Polynomials with the half-plane property and matroid theory ⋮ Complete monotonicity for inverse powers of some combinatorially defined polynomials ⋮ A strong log-concavity property for measures on Boolean algebras ⋮ Subtraction-free complexity, cluster transformations, and spanning trees ⋮ Negative dependence and the geometry of polynomials ⋮ A criterion for the half-plane property

This page was built for publication: Matroid inequalities from electrical network theory