Search arXivSearch

arXiv · 1706.04593

Perturbed moments and a longer mollifier for critical zeros of $ζ$

Abstract

Let $A(s)$ be a general Dirichlet polynomial and $Φ$ be a smooth function supported in $[1,2]$ with mild bounds on its derivatives. New main terms for the integral $I(α,β)=\int_{\mathbb{R}} ζ(\frac{1}{2}+α+it)ζ(\frac{1}{2}+β+it)|A(\frac{1}{2}+it)|^2 Φ(\frac{t}{T})dt$ are given. For the error term, we show that the length of the Feng mollifier can be increased from $θ< \frac{17}{33}$ to $θ< \frac{6}{11}$ by decomposing the error into Type I and Type II sums and then studying the resulting sums of Kloosterman sums. As an application, we slightly increase the proportion of zeros of $ζ(s)$ on the critical line.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kyle Pratt, Nicolas Robles. 2018-06-01. Perturbed moments and a longer mollifier for critical zeros of $ζ$. https://doi.org/10.1007/s40993-018-0103-4

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT