Remarks on one combinatorial application of the Aleksandrov-Fenchel inequalities

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

18 pages, one figure, two tables. Minor typos and references fixed

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Remarks on one combinatorial application of the Aleksandrov-Fenchel inequalities does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Remarks on one combinatorial application of the Aleksandrov-Fenchel inequalities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Remarks on one combinatorial application of the Aleksandrov-Fenchel inequalities will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-178310

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.