Elliptic Curve Rank Leaderboard

curve #6488

y2 + xy = x3 − 311310556984431516061386470x + 2099176015151900501826081277450638173412
a-invariants
[1, 0, 0, -311310556984431516061386470, 2099176015151900501826081277450638173412]
c-invariants
[14942906735252712770946550561, -1813688077091264447937837102786507801653809]
rank (lower bound)
≥ 20
torsion subgroup
trivial
conductor (N)
4717721772249207926330637464217482024447812014820011301605990
discriminant (Δ)
27282467042020061927279922914105390091247496570795617309974922879330114560000000
Faltings height
14.0689
naive height
194.6221
primes of bad reduction
2, 3, 5, 7, 239, 1619, 37588753211, 4826273305783, 320035715605441459690577420243
regulator
636538277768158637.064614801752982495143144525870534468678414934350760107505562
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,12,13,27,43,151,156,174,184: 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.