Related papers: Lower bounds for contingency tables via Lorentzian…

In this paper, we present some explicit exponents in the estimates for the volumes of sub-level sets of polynomials on bounded sets, and applications to the decay of oscillatory integrals and the convergent of singular integrals.

We present some new lower bound estimates for certain numbers in Laver table theory and introduce several related structures of interest.

In this paper an explicit formula for a lower bound on the volume of a hyperbolic orbifold, dependent on dimension and the maximal order of torsion in the orbifolds' fundamental group, is constructed.

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…

This paper is devoted to the study of lower and upper bounds for the number of vertices of the polytope of $n\times n\times n$ stochastic tensors (i.e., triply stochastic arrays of dimension $n$). By using known results on polytopes (i.e.,…

The type $A$ Kostant partition function is an important combinatorial object with various applications: it counts integer flows on the complete directed graph, computes Hilbert series of spaces of diagonal harmonics, and can be used to…

We give upper bounds for volume of sublevel sets of real polynomials. Our method is to combine a version of global Lojasiewicz inequality with some well known estimate on volume of tubes around real algebraic sets. Some applications to…

We construct examples of contingency tables on $n$ binary random variables where the gap between the linear programming lower/upper bound and the true integer lower/upper bounds on cell entries is exponentially large. These examples provide…

We prove asymptotic lower bounds on the variance of the number of vertices and missed area of random disc-polygons in convex discs whose boundary is $C_+^2$ smooth. The established lower bounds are of the same order as the upper bounds…

We introduce new families of combinatorial objects whose enumeration computes volumes of flow polytopes. These objects provide an interpretation, based on parking functions, of Baldoni and Vergne's generalization of a volume formula…

We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and…

We improve some upper bounds for minimal dispersion on the cube and torus. /Our new ingredient is an improvement of a probabilistic lemma used to obtain upper bounds for dispersion in several previous works. Our new lemma combines a random…

We prove a new polynomial lower bound on the scattering resolvent. For that, we construct a quasimode localized on a trajectory $\gamma$ which is trapped in the past, but not in the future. The power in the bound is expressed in terms of…

We present a new approach for random sampling of contingency tables of any size and constraints based on a recently introduced $\textit{probabilistic divide-and-conquer}$ technique. A simple exact sampling algorithm is presented for…

The goal of this article is to obtain bounds on the coefficients of modular and integral flow and tension polynomials of graphs. To this end we make use of the fact that these polynomials can be realized as Ehrhart polynomials of inside-out…

In this paper we derive explicit estimates for the functions which appear in the previous work of Bridgeman and Kahn. As a consequence, we obtain an explicit lower bound for the length of the shortest orthogeodesic in terms of the volume of…

We present a new proof rule for verifying lower bounds on quantities of probabilistic programs. Our proof rule is not confined to almost-surely terminating programs -- as is the case for existing rules -- and can be used to establish…

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

We give a sharp lower bound on the capacity of a real stable polynomial, depending only on the value of its gradient at $x = 1$. This result implies a sharp improvement to a similar inequality proved by Linial-Samorodnitsky-Wigderson in…

Given a filling primitive geodesic curve in a closed hyperbolic surface one obtains a hyperbolic three-manifold as the complement of the curve's canonical lift to the projective tangent bundle. In this paper we give the first known lower…