相关论文: Zero-density estimates and the optimality of the e…
Fix $\delta\in(0,1]$, $\sigma_0\in[0,1)$ and a real-valued function $\varepsilon(x)$ for which $\limsup_{x\to\infty}\varepsilon(x)\le 0$. For every set of primes ${\mathcal P}$ whose counting function $\pi_{\mathcal P}(x)$ satisfies an…
Let $\delta > 1/2$. We prove that if $A$ is a subset of the primes such that the relative density of $A$ in every reduced residue class is at least $\delta$, then almost all even integers can be written as the sum of two primes in $A$. The…
For $0 \leq \beta < \alpha < 1$ the distribution $\mathcal{H}$ over Boolean functions $h \colon \{-1, 1\}^d \to \{-1, 1\}$ that minimizes the expression \begin{equation*} \rho_{\alpha, \beta} = \frac{\log(1/\Pr_{\substack{h \sim \mathcal{H}…
In this paper we show that if $A$ is a subset of the primes with positive relative density $\delta$, then $A+A$ must have positive upper density $C_1\delta e^{-C_2(\log(1/\delta))^{2/3}(\log\log(1/\delta))^{1/3}}$ in $\mathbb{N}$. Our…
Optimal weighted Sobolev-Lorentz embeddings with homogeneous weights in open convex cones are established, with the exact value of the optimal constant. These embeddings are non-compact, and this paper investigates the structure of their…
We give a necessary condition for algebraicity of finite modules over the ring of formal power series. This condition is given in terms of local zero estimates. In fact we show that this condition is also sufficient when the module is a…
Prime number theorem asserts that (at large $x$) the prime counting function $\pi(x)$ is approximately the logarithmic integral $\mbox{li}(x)$. In the intermediate range, Riemann prime counting function $\mbox{Ri}^{(N)}(x)=\sum_{n=1}^N…
The present paper studies density deconvolution in the presence of small Berkson errors, in particular, when the variances of the errors tend to zero as the sample size grows. It is known that when the Berkson errors are present, in some…
We study the excess minimum risk in statistical inference, defined as the difference between the minimum expected loss in estimating a random variable from an observed feature vector and the minimum expected loss in estimating the same…
This short note contributes a new zero-free region of the zeta function. This zero-free region has the form {s : Re(s) > a}, where a = 21/40.
Non-negative trigonometric polynomials satisfying certain properties are employed when studying a number of aspects of the Riemann zeta function. When establishing zero-free regions in the critical strip, the classical polynomial…
The main objective of this paper is to explore the precise relationship between the Bethe free energy (or entropy) and the Shannon conditional entropy of graphical error correcting codes. The main result shows that the Bethe free energy…
We present a general approach for proving the optimality of the exponents on weighted estimates. We show that if an operator $T$ satisfies a bound like $$ \|T\|_{L^{p}(w)}\le c\, [w]^{\beta}_{A_p} \qquad w \in A_{p}, $$ then the optimal…
This is a continuation of the paper 'Symmetry breaking and other phenomena in the optimization of eigenvalues for composite membranes' by S. Chanillo, D. Grieser, M. Imai, K. Kurata, and I. Ohnishi. Again, we consider the following…
In this article we prove a general theorem which establishes the existence of limiting distributions for a wide class of error terms from prime number theory. As a corollary to our main theorem, we deduce previous results of Wintner (1935),…
This paper proposes a max-test for testing (possibly infinitely) many zero parameter restrictions in an extremum estimation framework. The test statistic is formed by estimating key parameters one at a time based on many empirical loss…
Let $S(t) \;:=\; \frac{\displaystyle 1}{\displaystyle \pi}\arg \zeta(\frac{1}{2} + it)$. We prove that, for $T^{\,27/82+\varepsilon} \le H \le T$, we have $$ {\rm mes}\Bigl\{t\in [T, T+H]\;:\; S(t)>0\Bigr\} = \frac{H}{2} +…
Consider a sequence of bits where we are trying to predict the next bit from the previous bits. Assume we are allowed to say 'predict 0' or 'predict 1', and our payoff is +1 if the prediction is correct and -1 otherwise. We will say that at…
Two widely-used computational paradigms for sublinear algorithms are using linear measurements to perform computations on a high dimensional input and using structured queries to access a massive input. Typically, algorithms in the former…
In this paper we establish a new explicit upper and lower bound for the $n$-th prime number, which improve the currently best estimates given by Dusart in 2010. As the main tool we use some recently obtained explicit estimates for the prime…