pith. sign in

arxiv: 1811.01600 · v1 · pith:3JRDS533new · submitted 2018-11-05 · 🧮 math.CO · cs.DM· math.PR

Log-Concave Polynomials III: Mason's Ultra-Log-Concavity Conjecture for Independent Sets of Matroids

classification 🧮 math.CO cs.DMmath.PR
keywords log-concaveindependentpolynomialssetscompletelyconjecturemasonmatroid
0
0 comments X
read the original abstract

We give a self-contained proof of the strongest version of Mason's conjecture, namely that for any matroid the sequence of the number of independent sets of given sizes is ultra log-concave. To do this, we introduce a class of polynomials, called completely log-concave polynomials, whose bivariate restrictions have ultra log-concave coefficients. At the heart of our proof we show that for any matroid, the homogenization of the generating polynomial of its independent sets is completely log-concave.

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.