ID: 2207.06699

Ranks of elliptic curves and deep neural networks

July 14, 2022

View on ArXiv
Matija Kazalicki, Domagoj Vlah
Mathematics
Number Theory

Determining the rank of an elliptic curve E/Q is a hard problem, and in some applications (e.g. when searching for curves of high rank) one has to rely on heuristics aimed at estimating the analytic rank (which is equal to the rank under the Birch and Swinnerton-Dyer conjecture). In this paper, we develop rank classification heuristics modeled by deep convolutional neural networks (CNN). Similarly to widely used Mestre-Nagao sums, it takes as an input the conductor of E and a sequence of normalized a_p-s (where a_p=p+1-#E(F_p) if p is a prime of good reduction) in some range (p<10^k for k=3,4,5), and tries to predict rank (or detect curves of ``high'' rank). The model has been trained and tested on two datasets: the LMFDB and a custom dataset consisting of elliptic curves with trivial torsion, conductor up to 10^30, and rank up to 10. For comparison, eight simple neural network models of Mestre-Nagao sums have also been developed. Experiments showed that CNN performed better than Mestre-Nagao sums on the LMFDB dataset (interestingly neural network that took as an input all Mestre-Nagao sums performed much better than each sum individually), while they were roughly equal on custom made dataset.

Similar papers 1

A probabilistic model for the distribution of ranks of elliptic curves over $\mathbb{Q}$

November 7, 2016

88% Match
Alvaro Lozano-Robledo
Number Theory

In this article, we propose a new probabilistic model for the distribution of ranks of elliptic curves in families of fixed Selmer rank, and compare the predictions with previous results, and with the databases of curves over the rationals that we have at our disposal. In addition, we document a phenomenon we refer to as Selmer bias that seems to play an important role in the data and in our models.

Find SimilarView on arXiv

Heuristics for the arithmetic of elliptic curves

November 28, 2017

87% Match
Bjorn Poonen
Number Theory
Algebraic Geometry

This is an introduction to a probabilistic model for the arithmetic of elliptic curves, a model developed in a series of articles of the author with Bhargava, Kane, Lenstra, Park, Rains, Voight, and Wood. We discuss the theoretical evidence for the model, and we make predictions about elliptic curves based on corresponding theorems proved about the model. In particular, the model suggests that all but finitely many elliptic curves over $\mathbb{Q}$ have rank $\le 21$, which w...

Find SimilarView on arXiv

Murmurations of Mestre-Nagao sums

March 26, 2024

87% Match
Zvonimir Bujanović, Matija Kazalicki, Lukas Novak
Number Theory

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 osci...

Find SimilarView on arXiv

Machine Learning meets Number Theory: The Data Science of Birch-Swinnerton-Dyer

November 4, 2019

86% Match
Laura Alessandretti, Andrea Baronchelli, Yang-Hui He
Number Theory
Machine Learning
Machine Learning

Empirical analysis is often the first step towards the birth of a conjecture. This is the case of the Birch-Swinnerton-Dyer (BSD) Conjecture describing the rational points on an elliptic curve, one of the most celebrated unsolved problems in mathematics. Here we extend the original empirical approach, to the analysis of the Cremona database of quantities relevant to BSD, inspecting more than 2.5 million elliptic curves by means of the latest techniques in data science, machin...

Find SimilarView on arXiv

On the rank of elliptic curves

September 24, 2008

85% Match
Jorma Jormakka
General Mathematics

The paper proves that the Birch and Swinnerton-Dyer conjecture is false.

Find SimilarView on arXiv
85% Match
Yang-Hui He, Kyu-Hwan Lee, Thomas Oliver
Number Theory
Machine Learning

We show that standard machine-learning algorithms may be trained to predict certain invariants of low genus arithmetic curves. Using datasets of size around one hundred thousand, we demonstrate the utility of machine-learning in classification problems pertaining to the BSD invariants of an elliptic curve (including its rank and torsion subgroup), and the analogous invariants of a genus 2 curve. Our results show that a trained machine can efficiently classify curves according...

On the ranks of elliptic curves with isogenies

November 4, 2016

85% Match
Harris B. Daniels, Hannah Goodwillie
Number Theory

In recent years, the question of whether the ranks of elliptic curves defined over $\mathbb{Q}$ are unbounded has garnered much attention. One can create refined versions of this question by restricting one's attention to elliptic curves over $\mathbb{Q}$ with a certain algebraic structure, e.g., with a rational point of a given order. In an attempt to gather data about such questions, we look for examples of elliptic curves over $\mathbb{Q}$ with an $n$-isogeny and rank as l...

Find SimilarView on arXiv

Conjecture: 100% of elliptic surfaces over $\mathbb{Q}$ have rank zero

September 18, 2020

85% Match
Alex Cowan
Number Theory

Based on an equation for the rank of an elliptic surface over $\mathbb{Q}$ which appears in the work of Nagao, Rosen, and Silverman, we conjecture that 100% of elliptic surfaces have rank $0$ when ordered by the size of the coefficients of their Weierstrass equations, and present a probabilistic heuristic to justify this conjecture. We then discuss how it would follow from either understanding of certain $L$-functions, or from understanding of the local behaviour of the surfa...

Find SimilarView on arXiv
84% Match
Yang-Hui He, Kyu-Hwan Lee, ... , Pozdnyakov Alexey
Number Theory
Machine Learning

We investigate the average value of the $p$th Dirichlet coefficients of elliptic curves for a prime p in a fixed conductor range with given rank. Plotting this average yields a striking oscillating pattern, the details of which vary with the rank. Based on this observation, we perform various data-scientific experiments with the goal of classifying elliptic curves according to their ranks.

Databases of elliptic curves ordered by height and distributions of Selmer groups and ranks

February 5, 2016

84% Match
Jennifer S. Balakrishnan, Wei Ho, Nathan Kaplan, Simon Spicer, ... , Weigandt James
Number Theory
Algebraic Geometry

Most systematic tables of data associated to ranks of elliptic curves order the curves by conductor. Recent developments, led by work of Bhargava-Shankar studying the average sizes of $n$-Selmer groups, have given new upper bounds on the average algebraic rank in families of elliptic curves over $\mathbb{Q}$ ordered by height. We describe databases of elliptic curves over $\mathbb{Q}$ ordered by height in which we compute ranks and $2$-Selmer group sizes, the distributions of...

Find SimilarView on arXiv