Search arXivSearch

arXiv · 2405.20888

Upper Bounds on Large Deviations of Dirichlet $L$-functions in the $q$-aspect

Abstract

We prove a result on the large deviations of the central values of even primitive Dirichlet $L$-functions with a given modulus. For $V\sim α\log\log q$ with $0<α<1$, we show that \begin{equation}\nonumber\frac{1}{φ(q)} \# \left\{χ\text{ even, primitive mod }q: \log \left|L\left(χ,\frac{1}{2}\right)\right| >V\right\}\ll \frac{e^{-\frac{V^2}{\log\log q}}}{\sqrt{\log\log q}}.\end{equation} This yields the sharp upper bound for the fractional moments of central values of Dirichlet $L$-functions proved by Gao, upon noting that the number of even, primitive characters with modulus $q$ is $\frac{φ(q)}{2}+O(1).$ The proof is an adaptation to the $q$-aspect of the recursive scheme developed by Arguin, Bourgade and Radziwill for the local maxima of the Riemann zeta function, and applied by Arguin and Bailey to the large deviations in the $t$-aspect. We go further and get bounds on the case where $V=o(\log\log q)$. These bounds are not expected to be sharp, but the discrepancy from the Central Limit Theorem estimate grows very slowly with $q$. The method involves a formula for the twisted mollified second moment of central values of Dirichlet $L$-functions, building on the work of Iwaniec and Sarnak.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Louis-Pierre Arguin, Nathan Creighton. 2024-05-31. Upper Bounds on Large Deviations of Dirichlet $L$-functions in the $q$-aspect. https://arxiv.org/abs/2405.20888

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