Murmuration conjecture for elliptic curves ordered by naive height

About 1 year old · traced to

For integers A,BA,B, let EA,BE_{A,B} be the elliptic curve

y2=x3+Ax+B,y^2=x^3+Ax+B,

with no prime pp satisfying both p4∣Ap^4\mid A and p6∣Bp^6\mid B. Define its naive height by

H(EA,B)=max⁡(4∣A∣3,27∣B∣2),H(E_{A,B})=\max(4|A|^3,27|B|^2),

and write N(E)N(E) for its conductor, ϵ(E)\epsilon(E) for its root number, and ap(E)a_p(E) for its ppth coefficient. For a set SS, let EE∈S[f(E)]=∣S∣−1∑E∈Sf(E)\mathbb E_{E\in S}[f(E)]=|S|^{-1}\sum_{E\in S}f(E). Let J1J_1 be the Bessel function of the first kind, let vp(m)v_p(m) be the pp-adic valuation, and let ℓp,ν\ell_{p,\nu} and ℓ^p,ν\hat{\ell}_{p,\nu} be the local terms defined in the source.

For real numbers 0<C1<C20<C_1<C_2, the murmurations conjecture.

lim⁡X→∞E{E:H(E)≤X}[log⁡(N(E)C1+C22)N(E)∑p∈(C1N(E),C2N(E)]p prime⁡ϵ(E)ap(E)]=∫C1C22πu∑q∈Nemphsquarefree∑m∈Nμ(gcd⁡(m,q))qmϕ(qgcd⁡(m,q))J1(4πumq)∏p∣qℓ^p,2vp(m)∏p∣m, p∤qℓp,2vp(m) du.\begin{aligned} &\lim_{X\to\infty}\mathbb E_{\{E:H(E)\le X\}}\left[\frac{\log\left(N(E)\frac{C_1+C_2}{2}\right)}{N(E)}\sum_{\substack{p\in(C_1N(E),C_2N(E)]\\p\ \operatorname{prime}}}\epsilon(E)a_p(E)\right]\\ &=\int_{C_1}^{C_2}2\pi\sqrt{u}\sum_{\substack{q\in\mathbb N\\emph{squarefree}}}\sum_{m\in\mathbb N}\frac{\mu(\gcd(m,q))}{qm\phi\left(\frac{q}{\gcd(m,q)}\right)}J_1\left(4\pi\frac{\sqrt{u}m}{q}\right)\prod_{p\mid q}\hat{\ell}_{p,2v_p(m)}\prod_{p\mid m,\ p\nmid q}\ell_{p,{2v_p(m)}}\,du. \end{aligned}

This predicts the limiting correlation between the Fourier coefficients ap(E)a_p(E) and root numbers when elliptic curves are ordered by naive height. It extends the study of murmurations beyond conductor ordering and gives an explicit expression in terms of Bessel functions and local arithmetic factors; the status of the prediction is open.

References

Primary source

Will Sawin and Andrew V. Sutherland, “Murmurations for elliptic curves ordered by height”, arXiv:2504.12295 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.