Search arXivSearch

arXiv · 2008.04709

Universality of the Hurwitz zeta-function on the half plane of absolute convergence

Abstract

Let $K$ be a compact set with connected complement on the half-plane Re$(s)>0$, and let $f$ be a continuous function on $K$ which is analytic in its interior. We prove that for any parameter $0<α<1, α\neq \frac 1 2$ then $f(s)$ may be uniformly approximated arbitrarily closely by $ζ(1+iT+iδs,α)$ on $K$ for some $T,δ>0$, where $ζ(s,α)$ denote the Hurwitz zeta-function. This is the first known universality result that is also known to hold for the Hurwitz zeta-function with an algebraic irrational parameter.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Johan Andersson. 2020-08-11. Universality of the Hurwitz zeta-function on the half plane of absolute convergence. https://arxiv.org/abs/2008.04709

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