Papers
Topics
Authors
Recent
Search
2000 character limit reached

Murmurations for elliptic curves ordered by height

Published 16 Apr 2025 in math.NT | (2504.12295v1)

Abstract: He, Lee, Oliver, and Pozdnyakov [19] have empirically observed that the average of the $p$th coefficients of the $L$-functions of elliptic curves of particular ranks in a given range of conductors $N$ appears to approximate a continuous function of $p$, depending primarily on the parity of the rank. Hence the sum of $p$th coefficients against the root number also appears to approximate a continuous function, dubbed the murmuration density. However, it is not clear from this numerical data how to obtain an explicit formula for the murmuration density. Convergence of similar averages was proved by Zubrilina [32] for modular forms of weight 2 (of which elliptic curves form a thin subset) and analogous results for other families of automorphic forms have been obtained in further work [6,23]. Each of these works gives an explicit formula for the murmuration density. We consider a variant problem where the elliptic curves are ordered by naive height, and the $p$th coefficients are averaged over $p/N$ in a fixed interval. We give a conjecture for the murmuration density in this case, as an explicit but complicated sum of Bessel functions. This conjecture is motivated by a theorem about a variant problem where we sum the $n$th coefficients for $n$ with no small prime factors against a smooth weight function. We test this conjecture for elliptic curves of naive height up to $2{28}$ and find good agreement with the data. The theorem is proved using the Voronoi summation formula, and the method should apply to many different families of $L$-functions. This is the first work to give an explicit formula for the murmuration density of a family of elliptic curves, in any ordering.

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.

Collections

Sign up for free to add this paper to one or more collections.