Elliptic Curve Rank Leaderboard

curve #6515

y2 + xy = x3 − x2 − 51612695287476549x + 4412307341531288770766729
a-invariants
[1, -1, 0, -51612695287476549, 4412307341531288770766729]
c-invariants
[2477409373798874361, -3812233531934691315847519245]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
422185255072396715012517685057928778442049058
discriminant (Δ)
388956742386668659160742468137759436005989144841052
Faltings height
8.4897
naive height
127.0612
primes of bad reduction
2, 3, 11, 47, 1484303, 8670331, 134820667, 2377018785299191673
regulator
40178341575823.9795606735027207739965759477295087676473977783988808276441
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,1,28,41,59,61,66,111,165,182: 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 >= 17: the 17 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.