Search arXivSearch

arXiv · 2510.07710

On the uniform distribution modulo $1$ of zeros and $a$-points of zeta functions

Abstract

Fujii gave five sufficient conditions for the uniform distribution modulo $1$ of the sequence $(u f(γ_n))$, where $γ_n$ runs over the imaginary parts of the non-trivial zeros of the Riemann zeta function. In this paper, we provide four sufficient conditions for the uniform distribution modulo $1$ that apply to a much broader class of sequences. Our method relies solely on the asymptotic behavior of the counting function and does not require the intricate calculations concerning the Riemann zeta function employed by Fujii in his paper. As applications, we prove the uniform distribution modulo $1$ of $(u f(x_n))$ for various sequences $(x_n)$, including the non-trivial $a$-points of the derivatives of the Riemann zeta function, the non-trivial zeros of the derivatives of Dirichlet $L$-functions, and the non-trivial zeros of functions in the Selberg class. Furthermore, by applying the Erdős--Turán inequality, we obtain an upper bound for the discrepancy of these sequences.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hideki Murahara, Tomokazu Onozuka. 2026-07-17. On the uniform distribution modulo $1$ of zeros and $a$-points of zeta functions. https://arxiv.org/abs/2510.07710

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