Elliptic Curve Rank Leaderboard

curve #6490

y2 + xy = x3 − x2 − 28142489439385550143524x + 8405803115499779884518863965587724
a-invariants
[1, -1, 0, -28142489439385550143524, 8405803115499779884518863965587724]
c-invariants
[1350839493090506406889161, -7262613891785731042505391187436792325]
rank (lower bound)
≥ 20
torsion subgroup
trivial
conductor (N)
196347104202630277828224678520976443046562484852749066157604334
discriminant (Δ)
-29097565253392985165480954342019770950545551185885388245172550942258348
Faltings height
12.2026
naive height
169.7516
primes of bad reduction
2, 3, 7, 127, 14353421, 7708862556316319877716933, 110893095984415313988881719
regulator
4752201857280451808.56271155172708068957694213552375844824990955177053453695541
submitted by
Michael Rubinstein
submitted at
last updated

Witness: 20 independent points log in to add more points →

Commentary

Mestre ten-root construction, roots 0,4,99,100,148,150,166,174,188,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 >= 20: the 20 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.