Elliptic Curve Rank Leaderboard

curve #6130

y2 + xy + y = x3 − x2 − 417021599588606487x + 103355942904397210370672175
a-invariants
[1, -1, 1, -417021599588606487, 103355942904397210370672175]
c-invariants
[20017036780253111361, -89299534579322524249121758305]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
2046819555713424945668705479118862619827345878
discriminant (Δ)
26652014049742757487742217085414868043493918909079552
Faltings height
8.9243
naive height
133.3293
primes of bad reduction
2, 11, 17, 5472779560731082742429693794435461550340497
regulator
316975927372837026749.903161297866962283105628342513281352075549799550034
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,2,31,38,43,68,75,83,125,137: 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); the sets with S >= 31, or S >= 30 and one bad prime in that range, or S >= 29 and two or more bad primes, were screened by exact conductor and by a GRH explicit-formula upper bound on the rank, and the survivors were certified with ellrank. Rank 17, proved: 17 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.