Elliptic Curve Rank Leaderboard

curve #6486

y2 + xy = x3 − x2 − 2246946621357532095234x + 41545546795457030407521576974544
a-invariants
[1, -1, 0, -2246946621357532095234, 41545546795457030407521576974544]
c-invariants
[107853437825161540571241, -35895352430789533801885415573435445]
rank (lower bound)
≥ 20
torsion subgroup
trivial
conductor (N)
2492992669762339391373056866125452214880825163390514171138798
discriminant (Δ)
-19609880340350561652540465308942807122252570735229784470177785068
Faltings height
11.1383
naive height
159.1318
primes of bad reduction
2, 3, 19, 23, 467418881, 41235613974633777513431, 5481091952843413380510791
regulator
2103702594994226935.73476742595392354959001891784813913535252583245498714350503
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,9,56,64,86,96,100,123,156,180: 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.