Elliptic Curve Rank Leaderboard

curve #6492

y2 + xy = x3 − x2 − 237905368786990370844114x + 63251713740961730404610619988195520
a-invariants
[1, -1, 0, -237905368786990370844114, 63251713740961730404610619988195520]
c-invariants
[11419457701775537800517481, -54649480672139547509925585749698600629]
rank (lower bound)
≥ 20
torsion subgroup
trivial
conductor (N)
26334328961446354492261518081380917681712112753779724544284319830
discriminant (Δ)
-866564012387594102510980579365440822463839210304064060785355899405937500
Faltings height
12.5063
naive height
173.7880
primes of bad reduction
2, 3, 5, 13, 313, 5580100628223259, 12886946520483517602520702479333533488544497
regulator
9956358436237454257.54895726260377887093717407568272270911471074905871220310542
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,14,37,83,84,98,139,148,157,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.