Elliptic Curve Rank Leaderboard

curve #6548

y2 + xy = x3 + x2 − 273582084429322x + 1726865466416693607400
a-invariants
[1, 1, 0, -273582084429322, 1726865466416693607400]
c-invariants
[13131940052607481, -1492011861473573671349645]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
218292867487108465277534197619824822626186
discriminant (Δ)
22265872483685063458308488157222131907870972
Faltings height
7.1368
naive height
111.3415
primes of bad reduction
2, 3, 17, 2005650999449, 1067048131715009360542870207
regulator
5764029021631.173585729470874864422778413159229459774174919775139165774
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,22,81,93,94,101,143,152,159,185: 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.