Elliptic Curve Rank Leaderboard

curve #6508

y2 + xy + y = x3 − x2 − 114546485377913284632x + 470355099486874881428017771035
a-invariants
[1, -1, 1, -114546485377913284632, 470355099486874881428017771035]
c-invariants
[5498231298139837662321, -406386805931917856712178084694025]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
58355173931578483333998489018706959609875067416042
discriminant (Δ)
615917755882186101189757544362919497048390990719941354586112
Faltings height
10.3325
naive height
150.1761
primes of bad reduction
2, 11, 274962639936119, 88016446198598609, 109602174072609641
regulator
1933466697304407.6050319846549472013884767410311885133109484085654778908258
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,1,4,12,33,35,125,143,169,184: 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 >= 18: the 18 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.