Remarks on one combinatorial application of the Aleksandrov-Fenchel inequalities

Publication date 17 June 2004

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

Abstract: In 1981, Stanley applied the Aleksandrov-Fenchel inequalities to prove a logarithmic concavity theorem for regular matroids. Using ideas from electrical network theory we prove a generalization of this for the wider class of matroids with the ``half-plane property. Then we explore a nest of inequalities for weighted basis-generating polynomials that are related to these ideas. As a first result from this investigation we find that every matroid of rank three or corank three satisfies a condition only slightly weaker than the conclusion of Stanley's theorem.

This page was built for publication: Remarks on one combinatorial application of the Aleksandrov-Fenchel inequalities

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