Elliptic Curve Rank Leaderboard

curve #6526

y2 + xy = x3 − x2 − 164909076127119x + 878876885370687386409
a-invariants
[1, -1, 0, -164909076127119, 878876885370687386409]
c-invariants
[7915635654101721, -759349593339913458399645]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
2592577917287939260041241026684010025843766
discriminant (Δ)
-46666402511182906680742338480312180465187788
Faltings height
7.1213
naive height
109.9735
primes of bad reduction
2, 3, 607, 613, 2900009921, 44492766300765963486234739
regulator
12556720527367.53768584373724976637665287641542134104378782613441537976
submitted by
Michael Rubinstein
submitted at
last updated

Witness: 16 independent points log in to add more points →

Commentary

Mestre ten-root construction, roots 0,7,12,17,44,52,61,88,163,172: 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 >= 16: the 16 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.