Elliptic Curve Rank Leaderboard

curve #6478

y2 + xy + y = x3 − x2 − 42971398825907x + 89604125241357344275
a-invariants
[1, -1, 1, -42971398825907, 89604125241357344275]
c-invariants
[2062627143643521, -77417954926710599057985]
rank (lower bound)
≥ 15
torsion subgroup
trivial
conductor (N)
2426060742452274879046419019933625406
discriminant (Δ)
1609817457775691900541009433514997005402112
Faltings height
6.8172
naive height
105.7883
primes of bad reduction
2, 3, 1785018071362301, 75506883947453042867
regulator
1282143154747.8233904051598443171570147263511141268109598623709656983
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,10,24,37,45,48,68,87,111,122: 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 15, proved: 15 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.