Search arXivSearch

arXiv · 2605.03665

Joint extreme values of $L$-functions on and off the critical line

Abstract

It is shown that any number of distinct primitive $\mathrm{GL}(1)$ and $\mathrm{GL}(2)$ $L$-functions can simultaneously attain large values on the critical line. This is an unconditional improvement of a general result due to Heap and Li who have assumed the Riemann Hypothesis for more than three such $L$-functions. The joint distribution of $\mathrm{GL}(m)$ $L$-functions to the right of the critical line is also studied under certain zero-density estimates. In particular, we can partially recover results of Inoue and Li on Dirichlet $L$-functions and generally improve upon the work of Mahatab, Pańkowski and Vatwani on the class of $L$-functions introduced by Selberg. The main machinery in both cases, on and off the critical line, is the resonance method of Soundararajan and Hilberdink/Voronin, respectively. On the critical line we additionally introduce a variation of Heath-Brown's method for the fractional moments of the Riemann zeta-function which makes it possible to avoid using any information on the zero distribution of $L$-functions whose degree is less than three.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Athanasios Sourmelidis. 2026-05-05. Joint extreme values of $L$-functions on and off the critical line. https://arxiv.org/abs/2605.03665

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