Lower bounds for contingency tables via Lorentzian polynomials
Combinatorics
2021-02-16 v3 Optimization and Control
Probability
Abstract
We present a new lower bound on the number of contingency tables, improving upon and extending previous lower bounds by Barvinok and Gurvits. As an application, we obtain new lower bounds on the volumes of flow and transportation polytopes. Our proofs are based on recent results on Lorentzian polynomials.
Cite
@article{arxiv.2008.05907,
title = {Lower bounds for contingency tables via Lorentzian polynomials},
author = {Petter Brändén and Jonathan Leake and Igor Pak},
journal= {arXiv preprint arXiv:2008.05907},
year = {2021}
}
Comments
28 pages