Search arXivSearch

arXiv · 1809.10140

Euler products of Selberg zeta functions in the critical strip

Abstract

For any congruence subgroup of the modular group, we extend the region of convergence of the Euler products of the Selberg zeta functions beyond the boundary Re s = 1, if they are attached with a nontrivial irreducible unitary representation. The region is determined by the size of the lowest eigenvalue of the Laplacian, and it extends to Re s $\geqslant$ 3/4 under Selberg's eigenvalue conjecture. More generally, for any unitary representation we establish the relation between the behavior of partial Euler products in the critical strip and the estimate of the error term in the prime geodesic theorem. For the trivial representation, the proof essentially exploits the idea of the celebrated work of Ramanujan.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ikuya Kaneko, Shin-ya Koyama. 2018-10-21. Euler products of Selberg zeta functions in the critical strip. https://doi.org/10.1007/s11139-022-00550-y

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