Search arXivSearch

arXiv · 2410.22711

Conditional estimates for $L$-functions in the Selberg class II

Abstract

Assuming the Generalized Riemann Hypothesis, we provide uniform upper and lower bounds with explicit main terms for $\log{\left|\cL(s)\right|}$ for $σ\in (1/2,1)$ and for functions in the Selberg class. In particular, we focus on the region $0\leqσ-1/2\ll 1/\log{\log{\left(\sq|t|^{\sdeg}\right)}}$. We also provide estimates under additional assumptions on the distribution of Dirichlet coefficients of $\cL(s)$ on prime numbers. Moreover, by assuming a polynomial Euler product representation for $\cL(s)$, we establish both uniform bounds and completely explicit estimates by also assuming the strong $λ$-conjecture. In addition to providing estimates for a large set of functions, our results improve the best known estimates for specific functions in the Selberg class including the lower bounds for the Riemann zeta function close to the critical line.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Neea Palojärvi, Aleksander Simonič. 2025-05-05. Conditional estimates for $L$-functions in the Selberg class II. https://arxiv.org/abs/2410.22711

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