Search arXivSearch

arXiv · 1911.05365

A footnote to a theorem of Halász

Abstract

We study multiplicative functions $f$ satisfying $|f(n)|\le 1$ for all $n$, the associated Dirichlet series $F(s):=\sum_{n=1}^{\infty} f(n) n^{-s}$, and the summatory function $S_f(x):=\sum_{n\le x} f(n)$. Up to a possible trivial contribution from the numbers $f(2^k)$, $F(s)$ may have at most one zero or one pole on the one-line, in a sense made precise by Halász. We estimate $\log F(s)$ away from any such point and show that if $F(s)$ has a zero on the one-line in the sense of Halász, then $|S_f(x)|\le (x/\log x) \exp\big(c\sqrt{\log \log x}\big)$ for all $c>0$ when $x$ is large enough. This bound is best possible.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Éric Saïas, Kristian Seip. 2019-11-13. A footnote to a theorem of Halász. https://doi.org/10.7169/facm%2F1847

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