Elliptic Curve Rank Leaderboard

curve #6517

y2 = x3 − 15384564398667087x + 761781563325326731371570
a-invariants
[0, 0, 0, -15384564398667087, 761781563325326731371570]
c-invariants
[738459091136020176, -658179270713082295905036480]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
6810058810005453132518759329541962443430063224
discriminant (Δ)
-17651672435534134519488624182172766653370723876608
Faltings height
8.2148
naive height
123.5030
primes of bad reduction
2, 3, 1721308271520361, 54948989500539799425066454847
regulator
155866337221101.604160058433357152740957920067288092827540300692270609670
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,8,83,107,123,146,151,154,163,183: 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 >= 17: the 17 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.