Table of Contents
Fetching ...

Murmurations of Mestre-Nagao sums

Zvonimir Bujanović, Matija Kazalicki, Lukas Novak

Abstract

This paper investigates the detection of the rank of elliptic curves with ranks 0 and 1, employing a heuristic known as the Mestre-Nagao sum \[ S(B) = \frac{1}{\log{B}} \sum_{\substack{p<B \\ \textrm{good reduction}}} \frac{a_p(E)\log{p}}{p}, \] where $a_p(E)$ is defined as $p + 1 - \#E(\mathbb{F}_p)$ for an elliptic curve $E/\mathbb{Q}$ with good reduction at prime $p$. This approach is inspired by the Birch and Swinnerton-Dyer conjecture. Our observations reveal an oscillatory behavior in the sums, closely associated with the recently discovered phenomena of murmurations of elliptic curves. Surprisingly, this suggests that in some cases, opting for a smaller value of $B$ yields a more accurate classification than choosing a larger one. For instance, when considering elliptic curves with conductors within the range of $[40\,000,45\,000]$, the rank classification based on $a_p$'s with $p < B = 3\,200$ produces better results compared to using $B = 50\,000$. This phenomenon finds partial explanation in the recent work of Zubrilina.

Murmurations of Mestre-Nagao sums

Abstract

This paper investigates the detection of the rank of elliptic curves with ranks 0 and 1, employing a heuristic known as the Mestre-Nagao sum where is defined as for an elliptic curve with good reduction at prime . This approach is inspired by the Birch and Swinnerton-Dyer conjecture. Our observations reveal an oscillatory behavior in the sums, closely associated with the recently discovered phenomena of murmurations of elliptic curves. Surprisingly, this suggests that in some cases, opting for a smaller value of yields a more accurate classification than choosing a larger one. For instance, when considering elliptic curves with conductors within the range of , the rank classification based on 's with produces better results compared to using . This phenomenon finds partial explanation in the recent work of Zubrilina.
Paper Structure (6 sections, 2 theorems, 18 equations, 3 figures, 1 table)

This paper contains 6 sections, 2 theorems, 18 equations, 3 figures, 1 table.

Key Result

Proposition 3.1

With the notation as above, the following holds (under RH):

Figures (3)

  • Figure 1: Average values of $S(B)$ and their corresponding $90\%$ confidence intervals are computed for $1026$ curves of rank $0$ and $1485$ curves of $1$, within the conductor range $[40\,000, 45\,000]$.
  • Figure 2: Distribution of averages of $a_p$'s of elliptic curves of rank $0$ (blue) and $1$ (red) with conductors in $[7\,500,10\,000]$. The figure is sourced from Hee_Lee_Oliver_Arithmetic_Pozdnyakov.
  • Figure 3: Graph of $f(x)$ for $N=100,000$.

Theorems & Definitions (3)

  • Proposition 3.1
  • Proposition 3.2
  • proof