Elliptic Curve Rank Leaderboard

curve #6530

y2 + xy + y = x3 − x2 − 25210893427348167x + 1542919214617462480818495
a-invariants
[1, -1, 1, -25210893427348167, 1542919214617462480818495]
c-invariants
[1210122884512712001, -1333082195983934603119975905]
rank (lower bound)
≥ 15
torsion subgroup
trivial
conductor (N)
1894719850308446189709956049173645986
discriminant (Δ)
-2897766659211978352636884838975803703420186001408
Faltings height
8.1957
naive height
124.9146
primes of bad reduction
2, 17, 29, 61, 97, 2423, 134033422325366541651733711
regulator
56573354508.852137861202534108449428333825943006757936437807163863985
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,5,35,50,65,100,107,138,143,187: 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 >= 15: the 15 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.