Elliptic Curve Rank Leaderboard

curve #6178

y2 + xy + y = x3 − x2 − 685990640466912207377x + 6868986816410030691695751537025
a-invariants
[1, -1, 1, -685990640466912207377, 6868986816410030691695751537025]
c-invariants
[32927550742411785954081, -5934804609230092539284276291196465]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
4611183920987854374283972944656606152532275998
discriminant (Δ)
277153811365506991014369371472342991972265109964043691252252672
Faltings height
10.8104
naive height
155.5458
primes of bad reduction
2, 3, 11, 13, 152567, 9767749697, 1202122631955592866183495823
regulator
40502905044105895411.5027022790282188857048388954134323457620087222879967
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,1,22,28,54,82,96,104,134,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.