Search arXivSearch

arXiv · 2405.12662

An $L^2$-bound for the Barban-Vehov weights

Abstract

Let $λ$ the Barban--Vehov weights, defined in $(1)$. Let $X\ge z_1\ge100$ and $z_2=z_1^τ$ for some $τ>1$. We prove that \begin{equation*} \sum_{n\le X}\frac{1}{n}\Bigl(\sum_{\substack{d|n}}λ_d\Bigr)^2 \le f(τ)\frac{\log X}{\log (z_2/z_1)}, \end{equation*} for a completely determined function $f:(1,\infty)\to\mathbb{R}_{>0}$. In particular, we may take $f(2)=30$, saving more than a factor of $5$ on what was the best known result for $τ=2$. Two related estimates are also provided for general $τ>1$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Olivier Ramaré, Sebastian Zuniga Alterman. 2024-05-21. An $L^2$-bound for the Barban-Vehov weights. https://doi.org/10.7169/facm%2F241018-19-5

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