Elliptic Curve Rank Leaderboard

curve #6021

y2 = x3 + x2 − 47792592003323060x + 4074322830129091696892704
a-invariants
[0, 1, 0, -47792592003323060, 4074322830129091696892704]
c-invariants
[2294044416159506896, -3520214938995801723072337600]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
288851801178904845552271754711772794800808
discriminant (Δ)
-184712851598402307068968650001058240501639266770688
Faltings height
8.4478
naive height
126.8566
primes of bad reduction
2, 7, 29, 41, 22697933, 191125611813845590306777091939
regulator
252885490773130.4998324695894134792709378520277746620150241352337558445
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,5,7,18,32,36,42,57,59,72: 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.