Elliptic Curve Rank Leaderboard

curve #6543

y2 + xy = x3 − x2 − 1338596759009633685x + 730170845545001983119649241
a-invariants
[1, -1, 0, -1338596759009633685, 730170845545001983119649241]
c-invariants
[64252644432462416889, -630867610261744813469296068237]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
7294698983778457454262083797263385660833098956868970
discriminant (Δ)
-76813180299187156993379742385183451008572532015830254100
Faltings height
9.4383
naive height
137.2338
primes of bad reduction
2, 3, 5, 13, 10837, 9425447, 10535659, 57198061, 101290210187995189268881
regulator
4658620867197869.8041368147606290265312986590913717467376449994858535370829
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,7,38,42,55,91,120,160,168,191: 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 >= 18: the 18 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.