Search arXivSearch

arXiv · 2310.14797

On the density hypothesis for $L$-functions associated with holomorphic cusp forms

Abstract

We study the range of validity of the density hypothesis for the zeros of $L$-functions associated with cusp Hecke eigenforms $f$ of even integral weight and prove that $N_{f}(σ, T) \ll T^{2(1-σ)+\varepsilon}$ holds for $σ\geq 1407/1601$. This improves upon a result of Ivić, who had previously shown the zero-density estimate in the narrower range $σ\geq 53/60$. Our result relies on an improvement of the large value estimates for Dirichlet polynomials based on mixed moment estimates for the Riemann zeta function. The main ingredients in our proof are the Halász-Montgomery inequality, Ivić's mixed moment bounds for the zeta function, Huxley's subdivision argument, Bourgain's dichotomy approach, and Heath-Brown's bound for double zeta sums.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bin Chen, Gregory Debruyne, Jasson Vindas. 2024-03-26. On the density hypothesis for $L$-functions associated with holomorphic cusp forms. https://doi.org/10.4171/rmi%2F1481

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