Elliptic Curve Rank Leaderboard

curve #6180

y2 + xy + y = x3 − x2 − 80616432047323437x + 8848311542285694409453845
a-invariants
[1, -1, 1, -80616432047323437, 8848311542285694409453845]
c-invariants
[3869588738271524961, -7644941155121690647546259985]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
1306046612716079154116875733335056508018 ★ record for rank ≥ 16
discriminant (Δ)
-291087140633757129466097043550694728265683623477248
Faltings height
8.5304
naive height
128.4077
primes of bad reduction
2, 11, 13, 23, 47, 11689, 47544887206007, 691023926341891
regulator
1171929037758307.608926218121939282658429744877497697969782811540851053
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,60,63,72,75,77,101,113,120: 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.