Elliptic Curve Rank Leaderboard

curve #6511

y2 + xy = x3 + x2 − 19180089265078004x + 57435949186268132132832804
a-invariants
[1, 1, 0, -19180089265078004, 57435949186268132132832804]
c-invariants
[920644284723744217, -49624660103840498298195624221]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
657741528725712916243850244735198959476234712957286
discriminant (Δ)
-1424668151219894176584179630096440946225524388265481476
Faltings height
9.0701
naive height
132.1486
primes of bad reduction
2, 3, 19, 42461, 135881456693947204440617798032043224696229959
regulator
5457686906867988.9296734238659049444739599087272892279082832287728452851958
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,3,16,115,120,132,141,156,181,196: 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.