Related papers: Lower bounds for contingency tables via Lorentzian…

We use the Dong-Sogge-Zelditch formula to obtain a lower bound for the volume of the nodal sets of eigenfunctions. Our result improves the recent results of Sogge-Zelditch and in dimensions n \leq 5 gives a new proof for the lower bounds of…

We prove several geometric theorems using tools from the theory of convex optimization. In the Riemannian setting, we prove the max flow-min cut theorem for boundary regions, applied recently to develop a "bit-thread" interpretation of…

We develop area and volume comparison theorems for the evolution of spacelike, acausal, causally complete hypersurfaces in Lorentzian manifolds, where one has a lower bound on the Ricci tensor along timelike curves, and an upper bound on…

The goal of the present work is three-fold. The first goal is to set foundational results on optimal transport in Lorentzian (pre-)length spaces, including cyclical monotonicity, stability of optimal couplings and Kantorovich duality…

For a non-vanishing gradient-like vector field on a compact manifold $X^{n+1}$ with boundary, a discrete set of trajectories may be tangent to the boundary with reduced multiplicity $n$, which is the maximum possible. (Among them are…

We prove super-polynomial lower bounds for low-depth arithmetic circuits using the shifted partials measure [Gupta-Kamath-Kayal-Saptharishi, CCC 2013], [Kayal, ECCC 2012] and the affine projections of partials measure [Garg-Kayal-Saha, FOCS…

We prove an asymptotic estimate for the number of mxn non-negative integer matrices (contingency tables) with prescribed row and column sums and, more generally, for the number of integer feasible flows in a network. Similarly, we estimate…

Recent research has made significant progress on the problem of bounding log partition functions for exponential family graphical models. Such bounds have associated dual parameters that are often used as heuristic estimates of the marginal…

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

We give upper and lower bounds for weighted Chebyshev and residual polynomials on subsets of the real line. As an application, we prove a Szeg\H{o}-type theorem in the setting of Parreau--Widom sets.

In this paper, we give a sharp lower bound for the minimum deviation of the Chebyshev polynomial on a compact subset of the real line in terms of the corresponding logarithmic capacity. Especially if the set is the union of several real…

We give the proof of a tight lower bound on the probability that a binomial random variable exceeds its expected value. The inequality plays an important role in a variety of contexts, including the analysis of relative deviation bounds in…

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…

Minkowski's second theorem on successive minima gives an upper bound on the volume of a convex body in terms of its successive minima. We study the problem to generalize Minkowski's bound by replacing the volume by the lattice point…

In this article we study minimal flat Lorentzian surfaces in Lorentzian complex space forms. First we prove that, for minimal flat Lorentzian surfaces in a Lorentzian complex form, the equation of Ricci is a consequence of the equations of…

Every finite collection of oriented closed geodesics in the modular surface has a canonically associated link in its unit tangent bundle coming from the periodic orbits of the geodesic flow. We study the volume of the associated link…

We introduce several new notions of (sectional) curvature bounds for Lorentzian pre-length spaces: On the one hand, we provide convexity/concavity conditions for the (modified) time separation function, and, on the other hand, we study…

In this paper we prove new lower bounds for the minimum distance of a toric surface code defined by a convex lattice polygon P. The bounds involve a geometric invariant L(P), called the full Minkowski length of P which can be easily…

Different techniques have been used to prove several transference theorems of the form "nontrivial algorithms for a circuit class C yield circuit lower bounds against C". In this survey we revisit many of these results. We discuss how…