Ranks of elliptic curves and deep neural networks

In this paper, under GRH for elliptic $L$-functions, we give an upper bound for the probability for an elliptic curve with analytic rank $\leq a$ for $a \geq 11$, and also give an upper bound of $n$-th moments of analytic ranks of elliptic curves. These are applications of counting elliptic curves with local conditions, for example, having good reduction at $p$.

This paper presents empirical evidence supporting Goldfeld's conjecture on the average analytic rank of a family of quadratic twists of a fixed elliptic curve in the function field setting. In particular, we consider representatives of the four classes of non-isogenous elliptic curves over F_q(t) with (q,6)=1 possessing two places of multiplicative reduction and one place of additive reduction. The case of q=5 provides the largest data set as well as the most convincing evide...

We report on two machine learning experiments in search of statistical relationships between Dirichlet coefficients and root numbers or analytic ranks of certain low-degree $L$-functions. The first experiment is to construct interpretable models based on murmurations, a recently discovered correlation between Dirichlet coefficients and root numbers. We show experimentally that these models achieve high accuracy by learning a combination of Mestre-Nagao type heuristics and mur...

In this article, we prove that the average rank of elliptic curves over $\mathbb{Q}$, when ordered by height, is less than $1$ (in fact, less than $.885$). As a consequence of our methods, we also prove that at least four fifths of all elliptic curves over $\mathbb{Q}$ have rank either 0 or 1; furthermore, at least one fifth of all elliptic curves in fact have rank 0. The primary ingredient in the proofs of these theorems is a determination of the average size of the $5$-Selm...

We describe a method for bounding the rank of an elliptic curve under the assumptions of the Birch and Swinnerton-Dyer conjecture and the generalized Riemann hypothesis. As an example, we compute, under these conjectures, exact upper bounds for curves which are known to have rank at least as large as 20, 21, 22, 23, and 24. For the known curve of rank at least 28, we get a bound of 30.

Bhargava and Shankar prove that as E varies over all elliptic curves over Q, the average rank of the finitely generated abelian group E(Q) is bounded. This result follows from an exact formula for the average size of the 2-Selmer group, which in turn follows from an asymptotic formula for the number of binary quartic forms over Z with bounded invariants. We explain their proof, as well as other arithmetic applications.

The well-known analogies between number fields and function fields have led to the transposition of many problems from one domain to the other. In this paper, we will discuss traffic of this sort, in both directions, in the theory of elliptic curves. In the first part of the paper, we consider various works on Heegner points and Gross-Zagier formulas in the function field context; these works lead to a complete proof of the conjecture of Birch and Swinnerton-Dyer for elliptic...

Under a hypothesis which is slightly stronger than the Riemann Hypothesis for elliptic curve $L$-functions, we show that both the average analytic rank and the average algebraic rank of elliptic curves in families of quadratic twists are exactly $\frac 12$. As a corollary we obtain that under this last hypothesis, the Birch and Swinnerton-Dyer Conjecture holds for almost all curves in our family, and that asymptotically one half of these curves have algebraic rank $0$, and th...

We describe an algorithm to prove the Birch and Swinnerton-Dyer conjectural formula for any given elliptic curve defined over the rational numbers of analytic rank zero or one. With computer assistance we have proved the formula for 16714 of the 16725 such curves of conductor less than 5000.

An elliptic curve E defined over \Q is an algebraic variety which forms a finitely generated abelian group, and the structure theorem then implies that E = \Z^r + \Z_{tors} for some r \geq 0; this value r is called the rank of E. It is a classical problem in the study of elliptic curves to classify curves by their rank. In this paper, the author uses the method of 2-descent to calculate the rank of two families of elliptic curves, where E is given by E: y^2 = x(x-p)(x-2) with...