Papers
Topics
Authors
Recent
Search
2000 character limit reached

Low-Lying Zeros on the Critical Line for Families of Dirichlet LL-Functions

Published 10 May 2026 in math.NT | (2605.09282v1)

Abstract: In this paper, we establish a new lower bound for the number of low-lying zeros of Dirichlet LL-functions L(s,χ)L(s, χ) on the critical line within extremely short intervals. Specifically, for a sufficiently large prime PP and real number T∈[a1/log⁡P,1]T \in [a_1/\sqrt{\log P}, 1], we prove that the sum of the number of zeros on the critical line N0(T,χ)N_0(T, χ) over characters χ mod Pχ\bmod P satisfies ∑χ mod PN0(T,χ)≫T2Plog⁡P. \sum_{χ\bmod P} N_0(T, χ) \gg T^2 P\sqrt{\log P} . Traditional approaches encounter significant technical barriers in this short-interval regime. The Levinson method fails due to its own inherent limitations in handling such restricted intervals , while standard applications of the Selberg mollifier are hindered by the emergence of complex, inseparable cross-terms that are difficult to evaluate. To overcome these obstacles, we introduce a novel analytic framework utilizing high-dimensional Mellin transforms. This approach systematically manages the multi-variable series generated by the mollifier calculations. By explicitly resolving these cross-term obstructions, we extract the localized lower bound, providing a robust method that circumvents the short-interval bottleneck and offers potential applicability to the zero statistics of higher-rank LL-function families.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.