Elliptic Curve Rank Leaderboard

curve #6583

y2 + xy = x3 − 6408049662848276003456113x + 6245207889476750152116716359069939817
a-invariants
[1, 0, 0, -6408049662848276003456113, 6245207889476750152116716359069939817]
c-invariants
[307586383816717248165893425, -5395859616508373511004568010108676842025]
rank (lower bound)
≥ 20
torsion subgroup
trivial
conductor (N)
3599475357224748163821940060318380897915623706587015613613350
discriminant (Δ)
-8531743209938488165949903005667543948009442138736703539973718428344320000
Faltings height
12.9733
naive height
182.9729
primes of bad reduction
2, 3, 5, 7, 1321, 409909, 5951606111609, 151959345041283201700245307971083461
regulator
37420496009027009110.3974620304557155831700348451204655472326749281702276526138
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,24,58,67,120,139,152,155,159,186: 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.