Elliptic Curve Rank Leaderboard

curve #6121

y2 = x3 + x2 − 60644523341955931815220x + 5753484063464912298436438516620224
a-invariants
[0, 1, 0, -60644523341955931815220, 5753484063464912298436438516620224]
c-invariants
[2910937120413884727130576, -4971010230851149848571566186722656960]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
12812290006126708208219509600625580071112139117656
discriminant (Δ)
-26016874788140069728912815710527686485545853826622963559548468516608
Faltings height
11.8528
naive height
168.9934
primes of bad reduction
2, 3, 7, 41, 103, 587087, 55772862889277, 551532355724953405051771
regulator
1120114749907382356777.2168829263665795794898612643494017833201518380188989
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,2,24,30,43,74,77,81,114,127: 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 18, proved: 18 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.