Search arXivSearch

arXiv · 2605.12688

A connection between low-lying zeros and central values of $L$-functions

Abstract

We discuss the relation between statistics on low-lying zeros of $L$-functions and distribution of the associated central values. More precisely, we deduce explicit conditional lower bounds toward the Keating-Snaith conjecture (on the distribution of central values of families of $L$-functions) from partial results toward the Rudnick-Sarnak density conjecture (on the one-level density for the low-lying zeros of these $L$-functions). We show in fact that the same crucial ingredient occurs in the classical approaches for proving both results, providing the connection. We precisely determine the relation between the type of symmetry of the family, the allowed Fourier support in its distributional statement, and the quality of the lower bounds obtained.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Didier Lesesvre, Ade Irma Suriajaya. 2026-05-12. A connection between low-lying zeros and central values of $L$-functions. https://arxiv.org/abs/2605.12688

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