Elliptic Curve Rank Leaderboard

curve #6023

y2 + xy = x3 − x2 − 7115033665748092x + 200160839874987844497316
a-invariants
[1, -1, 0, -7115033665748092, 200160839874987844497316]
c-invariants
[341521615955908425, -172938964115142225844093125]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
1913974163683850342150265853980708936255950
discriminant (Δ)
5744314958756155839378485394259602694938169937500
Faltings height
8.0814
naive height
121.1166
primes of bad reduction
2, 5, 7, 86017, 5090675449571, 12488443836690756079331
regulator
176918595405978.1798358622683071420983208153145407316612467420045630785
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,1,7,23,38,43,48,54,77,79: 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.