Elliptic Curve Rank Leaderboard

curve #6446

y2 + y = x3 − 673042908767087677x + 220208363142483477449876910
a-invariants
[0, 0, 1, -673042908767087677, 220208363142483477449876910]
c-invariants
[32306059620820208496, -190260025755105724516693650456]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
773059754146050006342215950428641671043554055
discriminant (Δ)
-1436134847582702454438362945934893437844608467931296875
Faltings height
9.1580
naive height
134.8364
primes of bad reduction
5, 11, 17, 826801876092032092344615989763253124110753
regulator
159599202082722.690741957858407373763348893609636151719512037892233065487
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,7,39,48,56,59,83,90,104,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); 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.