Elliptic Curve Rank Leaderboard

curve #6135

y2 + xy + y = x3 − 21376160230510453x + 1201767174120414373324292
a-invariants
[1, 0, 1, -21376160230510453, 1201767174120414373324292]
c-invariants
[1026055691064501721, -1038326839979121555148941085]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
110588158636195104405800630734472822633358
discriminant (Δ)
1214602353351415357930810588628618740883951116812
Faltings height
8.1405
naive height
124.4168
primes of bad reduction
2, 3, 31, 3241316820388679, 183431619188777602051957
regulator
17570571023746592.41945437728140375101951311670366780645917423710171186
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,4,12,13,15,19,32,62,81,102: 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); the sets with S >= 31, or S >= 30 and one bad prime in that range, or S >= 29 and two or more bad primes, were screened by exact conductor and by a GRH explicit-formula upper bound on the rank, and the survivors were certified with ellrank. Rank 16, proved: 16 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.