pith. sign in

arxiv: math/0406339 · v2 · submitted 2004-06-17 · 🧮 math.CO

Remarks on one combinatorial application of the Aleksandrov-Fenchel inequalities

classification 🧮 math.CO
keywords inequalitiesaleksandrov-fenchelideasmatroidsprovestanleytheoremthree
0
0 comments X
read the original 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 paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.