Elliptic Curve Rank Leaderboard

curve #6585

y2 + xy + y = x3 − x2 − 18123965630002077032x + 43500141910638695178369587755
a-invariants
[1, -1, 1, -18123965630002077032, 43500141910638695178369587755]
c-invariants
[869950350240099697521, -37584122606877056058030875181705]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
23800479216370300926351027774351639584054648667666
discriminant (Δ)
-436444447572214992289075361585428735991086415710919583679488
Faltings height
10.1447
naive height
145.4083
primes of bad reduction
2, 3, 7, 13, 43, 113, 40591, 3464168998502237797, 21266503090416836699
regulator
619791660415174.85057693215231964654863765128189273830312871530784791735801
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,29,43,63,74,110,137,169,180: 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 >= 18: the 18 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.