Elliptic Curve Rank Leaderboard

curve #6500

y2 = x3 − 35770506256734097807x + 51646522659139630586844252370
a-invariants
[0, 0, 0, -35770506256734097807, 51646522659139630586844252370]
c-invariants
[1716984300323236694736, -44622595577496640827033434047680]
rank (lower bound)
≥ 19
torsion subgroup
trivial
conductor (N)
71282932021622334919443458087017223694230637218579805784
discriminant (Δ)
1776940929435001564871886523193165352249781324584757398583552
Faltings height
10.2622
naive height
146.6846
primes of bad reduction
2, 19, 41, 3769, 87587, 49118132515147, 705424396042938613529302168457
regulator
97221898382089779.59550479739059723608661250666460109337700891927176513648260
submitted by
Michael Rubinstein
submitted at
last updated

Witness: 19 independent points log in to add more points →

Commentary

Mestre ten-root construction, roots 0,4,59,72,73,82,108,121,138,163: with p(x) = prod (x - a_i), write p = q^2 - r with q a monic quintic and deg r <= 4; the genus-one curve y^2 = r(x) carries the ten points (a_i, q(a_i)), and the curve submitted is the minimal Weierstrass model of its Jacobian. Found by enumerating integer ten-root sets 0 = a_1 < ... < a_10 and scoring each by S = sum of -a_p log(p)/p over the good primes 5 <= p <= 199 (with early abort on low partial sums); for the sets with S >= 31, or S >= 30 and one bad prime in that range, or S >= 29 and two or more bad primes, rational points were found by a point search on the quartic y^2 = r(x), and the curves were screened by conductor and by a GRH explicit-formula upper bound on the rank. Rank >= 19: the 19 listed points come from the point search and are independent (height matrix nonsingular at 57 and 115 digits). Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.