2000 character limit reached
Strictness of the log-concavity of generating polynomials of matroids
Published 21 Mar 2020 in math.CO and math.AC | (2003.09568v1)
Abstract: Recently, it was proved by Anari-Oveis Gharan-Vinzant, Anari-Liu-Oveis Gharan-Vinzant and Br\"{a}nd\'{e}n-Huh that, for any matroid $M$, its basis generating polynomial and its independent set generating polynomial are log-concave on the positive orthant. Using these, they obtain some combinatorial inequalities on matroids including a solution of strong Mason's conjecture. In this paper, we study the strictness of the log-concavity of these polynomials and determine when equality holds in these combinatorial inequalities. We also consider a generalization of our result to morphisms of matroids.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.