Related papers: Exponential lower bound for Berge-Ramsey problems

In this paper we study upper and lower bounds on the Bregman divergence $\Delta_{\mathcal{F}}^{\xi}(y,x):=\mathcal{F}(y)-\mathcal{F}(x)-\langle \xi, y-x\rangle $ for some convex functional $\mathcal{F}$ on a normed space $\mathcal{X}$, with…

We give the lower bound for the growth of the maximum value for a solution to the minimal surface equation with 0 boundary values over an unbounded simply connected domain.

We give explicit bounds for the tail probabilities for sums of independent geometric or exponential variables, possibly with different parameters.

We obtain a substantially improved lower bound for the minimum overlap problem asked by Erd\H{o}s. Our approach uses elementary Fourier analysis to translate the problem to a convex optimization program.

We give asymptotic lower bounds of the value for Bruss' optimal stopping problem with multiple stopping chances. It interestingly consists of the asymptotic threshold values in the optimal multiple stopping strategy. Another interesting…

We improve the upper bound on the Ramsey number $R(5,5)$ from $R(5,5) \le 49$ to $R(5,5) \le 48$. We also complete the catalogue of extremal graphs for $R(4,5)$.

A new error bound for the linear complementarity problem when the matrix involved is a B-matrix is presented, which improves the corresponding result in [C.Q. Li et al., A new error bound for linear complementarity problems for B-matrices.…

In this paper we discuss the explicit solution of certain extremal problems in Bergman spaces. In order to do this, we develop methods to calculate the Bergman projections of various functions. As a special case, we deal with canonical…

We prove that a Bishop-Gromov inequality gives a lower bound of coarse Ricci curvature. We also have an estimate of the eigenvalues of the Laplacian by a lower bound of coarse Ricci curvature.

We give a simple proof of the fact that an "$f$-estimate" for the $\bar\partial$-Neumann problem implies a lower bound on the geomatric type of the boundary along any complex one dimensional variety. The proof uses the existence of peak…

We determine the minimum possible critical exponent for all palindromes over finite alphabets.

We prove an epiperimetric inequality for the thin obstacle problem, extending the pioneering results by Weiss on the classical obstacle problem (Invent. Math. 138 (1999), no. 1, 23-50). This inequality provides the means to study the rate…

We derive a lower bound for the subword complexity of the base-$b$ expansion ($b\geq 2$) of all real numbers whose irrationality exponent is equal to 2. This provides a generalization of a theorem due to Ferenczi and Mauduit. As a…

We give explicit and asymptotic lower bounds for the quantity $|e^{s/t}-M/N|$ by studying a generalized continued fraction expansion of $e^{s/t}$. In cases $|s|\geq 3$ we improve existing results by extracting a large common factor from the…

This paper addresses the problem of deciding the lower-boundedness of an arbitrary real polynomial p in n variables.

We propose a method for computing upper bounds for the Heilbronn problem for triangles.

In this work, we undertake a comprehensive reformulation, modification, and extension of Smith and Spiegelhalter's (1980) and (1982) Bayes Factor work within the evolving subject of Objective Bayes Factors. Our primary focus centers on…

In this paper, we investigate the fundamental solution of the fractional Fokker-Planck equation. Utilizing the Littlewood-Paley decomposition technology, we present a concise proof of the pointwise estimate for the fundamental solution.

In this expository note we present simple proofs of the lower bound of Ramsey numbers (Erd\"os theorem), and of the estimation of discrepancy. Neither statements nor proofs require any knowledge beyond high-school curriculum (except a minor…

We show upper and lower bounds for angles in iterations of trisections of certain triangulations.