Tree metrics and log-concavity for matroids
Combinatorics
2026-01-15 v2
Abstract
We show that a set function satisfies the gross substitutes property if and only if its homogeneous generating polynomial is a Lorentzian polynomial for all positive , answering a question of Eur-Huh. We achieve this by giving a rank 1 upper bound for the distance matrix of an ultrametric tree, refining a classical result of Graham-Pollak. This characterization enables us to resolve two open problems that strengthen Mason's log-concavity conjectures for the number of independent sets of a matroid: one posed by Giansiracusa-Rinc\'on-Schleis-Ulirsch for valuated matroids, and two posed by Dowling in 1980 and Zhao in 1985 for ordinary matroids.
Cite
@article{arxiv.2601.02547,
title = {Tree metrics and log-concavity for matroids},
author = {Federico Ardila-Mantilla and Sergio Cristancho and Graham Denham and Christopher Eur and June Huh and Botong Wang},
journal= {arXiv preprint arXiv:2601.02547},
year = {2026}
}
Comments
17 pages; revised to add references; comments welcome