Remarks on one combinatorial application of the Aleksandrov-Fenchel inequalities

dc.creatorWagner, David G.
dc.date2004-06-17
dc.date2004-07-02
dc.date.accessioned2026-07-07T05:09:19Z
dc.date.available2026-07-07T05:09:19Z
dc.descriptionIn 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.
dc.description18 pages, one figure, two tables. Minor typos and references fixed
dc.identifierhttps://arxiv.org/abs/math/0406339
dc.identifierhttp://arxiv.org/abs/math/0406339
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/71588
dc.subjectCombinatorics
dc.subject05B35; 05A20, 05A15
dc.titleRemarks on one combinatorial application of the Aleksandrov-Fenchel inequalities
dc.typetext

Files

Collections