Elliptic Curve Rank Leaderboard

curve #6016

y2 + xy = x3 − 385429356167146103940x + 2649352370534867391664975491600
a-invariants
[1, 0, 0, -385429356167146103940, 2649352370534867391664975491600]
c-invariants
[18500609096023012989121, -2289040448169876340042573344226081]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
3837683991186327423730835916140464696192710
discriminant (Δ)
632259396165794733966036546654731253284046569058289651200000000
Faltings height
10.7868
naive height
153.8163
primes of bad reduction
2, 3, 5, 11, 17, 1277, 3396397, 157723717012615131334295214319
regulator
11961016627424.07072823478061145163627136689939930850283041102653517275
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,2,6,13,23,30,39,56,59,70: 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 the sum of -a_p log(p)/p over 5 <= p <= 199 (with early abort on low partial sums); the sets scoring at least 31 were screened by exact conductor and by a GRH explicit-formula upper bound on the rank, and the survivors were certified with ellrank. Rank 16, proved: 16 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.