Elliptic Curve Rank Leaderboard

curve #6491

y2 = x3 − 356791993462936282202847x + 82483064201637095874073487969100930
a-invariants
[0, 0, 0, -356791993462936282202847, 82483064201637095874073487969100930]
c-invariants
[17126015686220941545736656, -71265367470214450835199493605303203520]
rank (lower bound)
≥ 20
torsion subgroup
trivial
conductor (N)
298924201245331810645987537174751475783039180013627808551556424
discriminant (Δ)
-32225186328753991112408277771182149727125855533174090528732494133673728
Faltings height
12.3663
naive height
174.3189
primes of bad reduction
2, 3, 11, 19, 199, 2008121, 854639069945171972401, 58164312337319119233735288847
regulator
3507692373111666049.05211655466379882229932763024426543841236644464273655817686
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,5,15,24,25,32,52,128,148,195: 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.