2024/05/31 by Louis‐Pierre Arguin, Arguin, Louis-Pierre, Nathan Creighton +1 · 2 citations
Computer Science · Mathematics · #11S40 #60F10 #Analytic Number Theory Research #Coding theory and cryptography #FOS: Mathematics #Mathematical Approximation and Integration #Number Theory (math.NT) #Probability (math.PR)
paper · pdf · doi:10.48550/arxiv.2405.20888
openalex publication_date 2024/05/31 · openalex created_date 2024/06/04 · openalex updated_date 2026/07/28
We prove a result on the large deviations of the central values of even primitive Dirichlet L-functions with a given modulus. For V∼ αloglog q with 0<α<1, we show that (1)/(φ(q)) # \χ even, primitive mod q: log |L(χ,(1)/(2))| gt;V\≪ \frace-(V2)/(loglog q)√(loglog q). 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 (φ(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(loglog 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.