Related papers: Klee-Minty's LP and Upper Bounds for Dantzig's Sim…
We prove upper bounds on the rate, called "mixing rate", at which the von Neumann entropy of the expected density operator of a given ensemble of states changes under non-local unitary evolution. For an ensemble consisting of two states,…
Much work has been done attempting to understand the dynamic behaviour of the so-called "3x+1" function. It is known that finite sequences of iterations with a given length and a given number of odd terms have some combinatorial properties…
Boundary integral equations are an efficient and accurate tool for the numerical solution of elliptic boundary value problems. The solution is expressed as a layer potential; however, the error in its evaluation grows large near the…
Determining the asymptotic algebraic complexity of matrix multiplication, succinctly represented by the matrix multiplication exponent $\omega$, is a central problem in algebraic complexity theory. The best upper bounds on $\omega$, leading…
Expectation thresholds arise from a class of integer linear programs (LPs) that are fundamental to the study of thresholds in large random systems. An avenue towards estimating expectation thresholds comes from the fractional relaxation of…
We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of R^k, assuming that P is positive on the simplex. This bound depends only on the number…
We investigate the regularity in $L^p$ ($p>2$) of the gradient of any weak solution of a Cauchy problem with mixed Neumann-power type boundary conditions. Under suitable assumptions we prove the existence of weak solutions that satisfy…
We present an algorithm for a class of $n$-fold ILPs: whose existing algorithms in literature typically (1) are based on the \textit{augmentation framework} where one starts with an arbitrary solution and then iteratively moves towards an…
For a square matrix, the range of its Rayleigh quotients is known as the numerical range, which is a compact and convex set by the Toeplitz-Hausdorff theorem. The largest value and the smallest boundary value (in magnitude) of this convex…
In this paper we give new lower bounds on the Hilbert-Kunz multiplicity of unmixed non-regular local rings, bounding them uniformly away from one. Our results improve previous work of Aberbach and Enescu.
We prove existence of radially symmetric solutions and validity of Euler-Lagrange necessary conditions for a class of variational problems such that neither direct methods nor indirect methods of Calculus of Variations apply. We obtain…
This paper investigates simple bilevel optimization problems where we minimize an upper-level objective over the optimal solution set of a convex lower-level objective. Existing methods for such problems either only guarantee asymptotic…
Let $p\geq3$ be a large prime and let $n(p)\geq2$ denotes the least quadratic nonresidue modulo $p$. This note sharpens the standard upper bound of the least quadratic nonresidue from the unconditional upper bound $n(p)\ll…
The purpose of this article is to study extrapolation of solvability for boundary value problems of elliptic systems in divergence form on the upper half-space assuming De Giorgi type conditions. We develop a method allowing to treat each…
Most state-of-the-art branch-and-bound solvers for mixed-integer linear programming rely on limited-precision floating-point arithmetic and use numerical tolerances when reasoning about feasibility and optimality during their search. While…
For many mixed-integer programming (MIP) problems, high-quality dual bounds can be obtained either through advanced formulation techniques coupled with a state-of-the-art MIP solver, or through semidefinite programming (SDP) relaxation…
We introduce linear programs encoding regular expressions of finite languages. We show that, given a language, the optimum value of the associated linear program is a lower bound on the size of any regular expression of the language.…
Boundary value problems for integrable nonlinear evolution PDEs formulated on the half-line can be analyzed by the unified method introduced by one of the authors and used extensively in the literature. The implementation of this general…
Let x(t) be a non-constant T-periodic solution to the ordinary differential equation x'= f(x) in a Banach space X where f is assumed to be Lipschitz continuous with constant L. Then there exists a constant c such that T L >= c, with c only…
A central and longstanding open problem in coding theory is the rate-versus-distance trade-off for binary error-correcting codes. In a seminal work, Delsarte introduced a family of linear programs establishing relaxations on the size of…