Elliptic Curve Rank Leaderboard

curve #6015

y2 + xy + y = x3 − x2 − 1119865640553899952x + 446902980734841322429600275
a-invariants
[1, -1, 1, -1119865640553899952, 446902980734841322429600275]
c-invariants
[53753550746587197681, -386124175113011924219532248265]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
40220481138255114385295852764634938847335159754
discriminant (Δ)
3603013766079317930654158634553132769528396232293814272
Faltings height
9.2544
naive height
136.2928
primes of bad reduction
2, 17, 31, 83, 1361, 2399, 140812168004184810273002064451770823
regulator
83409892295286.2514521048952909376134486400973690709957226976579166096473
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,2,14,32,36,39,41,67,69,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 the sum of -a_p log(p)/p over 5 <= p <= 199 (with early abort on low partial sums); the sets scoring at least 31 were screened by exact conductor and by a GRH explicit-formula upper bound on the rank, and the survivors were certified with ellrank. Rank 17, proved: 17 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.