  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.
