Capacity of Lorentzian polynomials and distance to binomial distributions
arXiv:2011.14406
Abstract
In this paper we study the capacity of Lorentzian polynomials. We give a new proof of a theorem of Brändén, Leake and Pak. Our approach is probabilistic in nature and uses a lemma about a certain distance of binomial distributions to distributions with fixed expected value.
References in corpus (4)
- Rényi Divergence and Kullback-Leibler Divergence
- Unleashing the power of Schrijver's permanental inequality with the help of the Bethe Approximation
- Hyperbolic Polynomials Approach to Van der Waerden/Schrijver-Valiant like Conjectures : Sharper Bounds, Simpler Proofs and Algorithmic Applications
- Lower bounds for contingency tables via Lorentzian polynomials