Elliptic Curve Rank Leaderboard

curve #6542

y2 + xy + y = x3 + x2 − 740643077740344795780x + 7826715204074048822253094771077
a-invariants
[1, 1, 1, -740643077740344795780, 7826715204074048822253094771077]
c-invariants
[35550867731536550197441, -6762281936586609690413198008691489]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
29569932007815543557119328315676814775201506454790
discriminant (Δ)
-461219971485103722186524435336600686137683017079232504000000000
Faltings height
10.8421
naive height
155.7933
primes of bad reduction
2, 3, 5, 67, 97, 18233, 36063309542291, 230652848659863342573534269
regulator
2981717601914670.2134716452305783261185932593036975595625541674801179845195
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,19,36,37,84,92,110,113,159,194: 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.