Elliptic Curve Rank Leaderboard

curve #6521

y2 + xy + y = x3 − x2 − 742505315480810082x + 253603324606041325439235681
a-invariants
[1, -1, 1, -742505315480810082, 253603324606041325439235681]
c-invariants
[35640255143078883921, -219113272299238557035644650969]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
8620128113948600358915924702619189084210
discriminant (Δ)
-1585291487937183596297917393847546442929394744320000000
Faltings height
9.1728
naive height
135.1188
primes of bad reduction
2, 5, 7, 23, 97, 1249, 1921435612304048017245320365219
regulator
596789843420.3530397401681335789384738150251392745911948683668398942616
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,11,12,42,55,72,126,144,169,197: 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 >= 16: the 16 listed points come from the point search and are independent (height matrix nonsingular at 57 and 115 digits). Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.