Search arXivSearch

arXiv · 2008.02570

Dirichlet series with periodic coefficients, Riemann's functional equation and real zeros of Dirichlet $L$-functions

Abstract

In this paper, we give Dirichlet series with periodic coefficients that have Riemann's functional equation and real zeros of Dirichlet $L$-functions. The details are as follows. Let $L(s,χ)$ be the Dirichlet $L$-function and $G(χ)$ be the Gauss sum associate with a primitive Dirichlet character $χ$ (${\rm{mod}} \,\, q$). Put $f (s,χ) := q^s L(s,χ) + i^{-κ(χ)} G(χ) L(s,\overlineχ)$, where $\overlineχ$ is the complex conjugate of $χ$ and $κ(χ) :=(1-χ(-1))/2$. Then we prove that $f (s,χ)$ satisfies Riemann's functional equation appearing in Hamburger's theorem if $χ$ is even. In addition, we show that $f (σ,χ) \ne 0$ all $σ\ge 1$. Moreover, we prove that $f(σ,χ) \ne 0$ for all $1/2 \le σ< 1$ if and only if $L(σ,χ) \ne 0$ for all $1/2 \le σ< 1$. When $χ$ is real, all zeros of $f(s,χ)$ with $\Re (s) >0$ are on the line $σ=1/2$ if and only if GRH for $L(s,χ)$ is true. However, $f (s,χ)$ has infinitely many zeros off the critical line $σ=1/2$ if $χ$ is non-real.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Takashi Nakamura. 2021-09-10. Dirichlet series with periodic coefficients, Riemann's functional equation and real zeros of Dirichlet $L$-functions. https://arxiv.org/abs/2008.02570

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