Elliptic Curve Rank Leaderboard

curve #6170

y2 + xy + y = x3 − x2 − 1317837124555501486862x + 17527825124158781768840206873885
a-invariants
[1, -1, 1, -1317837124555501486862, 17527825124158781768840206873885]
c-invariants
[63256181978664071369361, -15144040906988534629373950417874745]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
174117693036610424661072980305410965823814139317254
discriminant (Δ)
13754516528009961126928258706015332744857844843096473684280983552
Faltings height
11.0630
naive height
157.5044
primes of bad reduction
2, 3, 7, 11, 139, 227, 281, 2267, 6250016683150324800955592393624539069
regulator
3512130842499827869410.3526012722933445876108697295973084380057956384840232
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,1,65,67,79,88,98,118,129,139: 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 18, proved: 18 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.