Elliptic Curve Rank Leaderboard

curve #6448

y2 + xy = x3 − 226606766226198211050x + 1286638541856085297831381102500
a-invariants
[1, 0, 0, -226606766226198211050, 1286638541856085297831381102500]
c-invariants
[10877124778857514130401, -1111655700179973384494599543755601]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
594031745999888841588209639676759504494404410
discriminant (Δ)
29580027970070802426245383657148505349573710750202296000000000
Faltings height
10.5815
naive height
152.2228
primes of bad reduction
2, 3, 5, 53, 179, 178469, 9239887, 24203837090149, 52293273415723
regulator
17365458542869.3058067879202587419238943525085984735958563148616489156066
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,22,33,50,77,82,95,106,120,143: 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); for the sets with S >= 31, or S >= 30 and one bad prime in that range, or S >= 29 and two or more bad primes, rational points were found by a point search on the quartic y^2 = r(x), and the curves were screened by conductor and by a GRH explicit-formula upper bound on the rank. Rank 17, proved: the 17 listed points come from the point search and are independent, and the 2-descent upper bound (ellrank) is 17. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.