Search arXivSearch

arXiv · 2607.09110

Averages of diagonal Elliott-Halberstam problem twisted by Möbius function with Sobolev and Hölder-Zygmund weights

Abstract

Recalling that the so-called Elliott-Halberstam conjecture twisted by the Möbius function $μ(n)$ claims that \[ \sum_{q\leq N^θ}\max_{y\leq N}\max_{(a,q)=1}\left|\sum_{\underset{\scriptstyle n\equiv a\,\mod\,q}{n\leq y}}Λ(n)μ\left(N-n\right)-\frac{1}{φ\left(q\right)}\sum_{n\leq y}Λ(n)μ\left(N-n\right)\right|\ll\frac{N}{\log\left(N\right)^{A}} \] for every $A>0$, where $0<θ<1$ is fixed, and also recalling that the validity of this conjecture, in combination with the validity of the classical Elliott-Halberstam for suitable $θ$, proves the binary Goldbach conjecture, in this paper we study weighted average variants of this problem. We will show that, under Generalized Riemann Hypothesis, a weak version of the Gonek-Hejhal conjecture and working with weights belonging to the Sobolev space $W^{2,1}$ or in the Hölder-Zygmund spaces $\mathcal{C}^δ$ for suitable range of $δ$, the bound of the average is consistent with the bound of the ``diagonal versions'' of this conjecture (that is, taking $y=N$ and taking $n\equiv N\mod q)$. In particular, in the case of weights in Sobolev space, the consistent upper bound holds for the whole $0<θ<1$ and, in the case of weights in the Hölder-Zygmund class $\mathcal{C}^δ$, for $θ$ that depends on the choice of $δ$ but still not below the $1/2-2\varepsilon$ threshold.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marco Cantarini. 2026-07-10. Averages of diagonal Elliott-Halberstam problem twisted by Möbius function with Sobolev and Hölder-Zygmund weights. https://arxiv.org/abs/2607.09110

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