Related papers: A note on Burgess bound
Conditionally on the Riemann Hypothesis we obtain bounds of the correct order of magnitude for the 2k-th moment of the Riemann zeta-function for all positive real k < 2.181. This provides for the first time an upper bound of the correct…
One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the "algebraic data" associated to the system. In technical terms, this translates to the…
We compute the Hilbert coefficients of a graded module with pure resolution and discuss lower and upper bounds for these coefficients for arbitrary graded modules.
We investigate the Boundary Harnack Principle in H\"older domains of exponent $\alpha>0$ by the analytical method developed in our previous work "A short proof of Boundary Harnack Principle".
We establish an upper bound on the tails of a random variable that arises as a solution of a stochastic difference equation. In the non--negative case our bound is similar to a lower bound obtained by Goldie and Gr\"ubel in 1996.
We revisit the well-known Gilbert-Varshamov (GV) bound for constrained systems. In 1991, Kolesnik and Krachkovsky showed that GV bound can be determined via the solution of some optimization problem. Later, Marcus and Roth (1992) modified…
Bayesian inference requires approximation methods to become computable, but for most of them it is impossible to quantify how close the approximation is to the true posterior. In this work, we present a theorem upper-bounding the KL…
An explicit subconvex bound for the Riemann zeta function $\zeta(s)$ on the critical line $s=1/2+it$ is proved. Previous subconvex bounds relied on an incorrect version of the Kusmin-Landau lemma. After accounting for the needed correction…
We study an inverse boundary value problem associated with $p$-Laplacian which is further perturbed by a linear second order term, defined on a bounded set $\Omega$ in $\R^n, n\geq 2$. We recover the coefficients at the boundary from the…
We obtain an improvement of the Beckner's inequality $\| f\|^{2}_{2} -\|f\|^{2}_{p} \leq (2-p) \| \nabla f\|_{2}^{2}$ valid for $p \in [1,2]$ and the Gaussian measure. Our improvement is essential for the intermediate case $p \in (1,2)$,…
We derive upper bounds for probabilities of the form $P(g(\mathbf{X})\geq t)$ using the southwest boundary (recently introduced in our previous work) $\partial_{\mathrm{SW}} Q(g^{-1}[t,\infty))$, where $Q$ is a reflection to the first…
We derive upper and lower bounds on the determinant of an exponential matrix. They can be transformed into corresponding bounds for the determinant of a univariate Gaussian matrix.
The background method is a widely used technique to bound mean properties of turbulent flows rigorously. This work reviews recent advances in the theoretical formulation and numerical implementation of the method. First, we describe how the…
I propose a notion of $(\omega_1,\beta)$-morass for the case $\omega_1 \leq \beta$.
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 refine the conditions for the lower bound in an abstract large deviation result with nonconvex rate function we had previously introduced. We apply the results to certain stochastic recursive schemes.
We outline a proof of the categorical geometric Langlands conjecture for GL(2), as formulated in reference [AG], modulo a number of more tractable statements that we call Quasi-Theorems.
Using the Moore--Penrose pseudoinverse, this work generalizes the gradient approximation technique called centred simplex gradient to allow sample sets containing any number of points. This approximation technique is called the…
We derive explicit lower and upper bounds for the probability generating functional of a stationary locally stable Gibbs point process, which can be applied to summary statistics like the F function. For pairwise interaction processes we…
We give lower bounds on the case of worst inhomogeneous approximation.