2000 character limit reached
Capacity of Lorentzian polynomials and distance to binomial distributions (2011.14406v2)
Published 29 Nov 2020 in math.CO
Abstract: In this paper we study the capacity of Lorentzian polynomials. We give a new proof of a theorem of Br\"and\'en, 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.
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.