Search arXivSearch

arXiv · 1810.10426

A note on the zeros of generalized Hurwitz zeta functions

Abstract

Given a function $f(n)$ periodic of period $q\geq 1$ and an irrational number $0<α\leq 1$, Chatterjee and Gun proved that the series $F(s,f,α)=\sum_{n=0}^{\infty}\frac{f(n)}{(n+α)^s}$ has infinitely many zeros for $σ>1$ when $α$ is transcendental and $F(s,f,α)$ has a pole at $s=1$, or when $α$ is algebraic irrational and $c=\frac{\max{f(n)}}{\min{f(n)}}<1.15$. In this note, we prove that the result holds in full generality.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Giamila Zaghloul. 2018-10-24. A note on the zeros of generalized Hurwitz zeta functions. https://doi.org/10.1016/j.jnt.2018.09.016

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