Search arXivSearch

arXiv · 2406.08608

Approximation of L-functions associated to Hecke cusp eigenforms

Abstract

We derive a family of approximations for L-functions of Hecke cusp eigenforms, according to a recipe first described by Matiyasevich for the Riemann xi function. We show that these approximations converge to the true L-function and point out the role of an equidistributional notion in ensuring the approximation is well-defined, and along the way we demonstrate error formulas which may be used to investigate analytic properties of the L-function and its derivatives, such as the locations and orders of zeros. Together with the Euler product expansion of the L-function, the family of approximations also encodes some of the key features of the L-function such as its functional equation. As an example, we apply this method to the L-function of the modular discriminant and demonstrate that the approximation successfully locates zeros of the L-function on the critical line. Finally, we derive via Mellin transforms a convolution-type formula which leads to precise error bounds in terms of the incomplete gamma function. This formula can be interpreted as an alternative definition for the approximation and sheds light on Matiyasevich's procedure.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

An Huang, Kamryn Spinelli. 2025-07-16. Approximation of L-functions associated to Hecke cusp eigenforms. https://doi.org/10.1016/j.jnt.2025.01.014

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