Elliptic Curve Rank Leaderboard

curve #6544

y2 + xy + y = x3 + x2 − 1794052724295234285x + 537263175277158761566433571
a-invariants
[1, 1, 1, -1794052724295234285, 537263175277158761566433571]
c-invariants
[86114530766171245681, -464195384085324150739682948105]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
39854001626708526367263643209818633966851636302943338
discriminant (Δ)
244862985994497186000467823881125687092336453445283868672
Faltings height
9.5192
naive height
137.7066
primes of bad reduction
2, 3, 23159, 286814353143547694685029889098684701173421681297
regulator
9608870863968002.4027394943931147281319147259308808113241811303565351072311
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,7,56,57,85,91,105,155,186,196: 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.