Elliptic Curve Rank Leaderboard

curve #6071

y2 = x3 − 23224755343755852x + 1454101348831682623642260
a-invariants
[0, 0, 0, -23224755343755852, 1454101348831682623642260]
c-invariants
[1114788256500280896, -1256343565390573786826912640]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
743330050898611727181276787476878581612392
discriminant (Δ)
-111685685052660028964828249430830396158923766149888
Faltings height
8.3497
naive height
124.7960
primes of bad reduction
2, 3, 7, 13, 169399, 669725691823818819025652417163929
regulator
160249153910427164.5358090414635435076559612608410760214520201878728073
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,7,44,49,64,66,82,101,124,139: 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 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.