Related papers: Exponential lower bound for Berge-Ramsey problems
In this paper we introduce a general framework for proving lower bounds for various Ramsey type problems within random settings. The main idea is to view the problem from an algorithmic perspective: we aim at providing an algorithm that…
An approach to constructing an upper bound for the Riemann-Farey sum is described.
We prove the existence and uniqueness of weak solution of a Neumann boundary problem for an elliptic partial differential equation (PDE for short) with a singular divergence term which can only be understood in a weak sense. A probabilistic…
A Berry-Esseen bound is obtained for self-normalized martingales under the assumption of finite moments. The bound coincides with the classical Berry-Esseen bound for standardized martingales. An example is given to show the optimality of…
We derive Moore-type upper bounds for regular simplicial complexes and present logarithmic lower bounds on their diameter based on minimum degree.
We prove the immediate appearance of an exponential lower bound, uniform in time and space, for continuous mild solutions to the full Boltzmann equation in a $C^2$ convex bounded domain with the physical Maxwellian diffusion boundary…
We use GL(2) delta method to establish the Burgess bound.
For any unsatisfiable CNF formula we give an exponential lower bound on the size of resolution refutations of a propositional statement that the formula has a resolution refutation. We describe three applications. (1) An open question in…
Another approach to constructing an upper bound for the Riemann-Farey sum is described.
We show how the presence of resonances close to the real axis implies exponential lower bounds on the norm of the cut-off resolvent on the real axis.
The Bruss-Robertson inequality gives a bound on the maximal number of elements of a random sample whose sum is less than a specified value, and the extension of that inequality which is given here neither requires the independence of the…
Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…
We prove an exponential estimate for the asymptotics of Bergman kernels of a positive line bundle under hypotheses of bounded geometry. We give further Bergman kernel proofs of complex geometry results, such as separation of points,…
We prove a general upper bound on the tradeoff between time and space that suffices for the reversible simulation of irreversible computation. Previously, only simulations using exponential time or quadratic space were known. The tradeoff…
An error bound for Gaussian Interpolation which is better than the current exponential-type error bound is presented.
We give description of rational solutions of polynomial-equations.
Let $(g_{n})_{n\geq 1}$ be a sequence of independent and identically distributed positive random $d\times d$ matrices and consider the matrix product $G_n: = g_n \ldots g_1$. Under suitable conditions, we establish the Berry-Esseen bounds…
We prove some non-tangential Burns-Krantz type boundary rigidity theorems.
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 give a formula for matrix exponentials and partial fraction decompositions.