Elliptic Curve Rank Leaderboard

curve #6167

y2 + xy + y = x3 − x2 − 20967825830676242381168x + 1049906339210514909937857261778131
a-invariants
[1, -1, 1, -20967825830676242381168, 1049906339210514909937857261778131]
c-invariants
[1006455639872459634296049, -907119077073355831806882605821973193]
rank (lower bound)
≥ 19
torsion subgroup
trivial
conductor (N)
19790611384047910958418807384150866111612560217535236970
discriminant (Δ)
113788885721116751303535254279442348583924098910605730046279929036800
Faltings height
11.7917
naive height
165.8054
primes of bad reduction
2, 3, 5, 7, 29, 5494134725747, 41438540727817, 1585972493424107581091963
regulator
729226925067455932207458.8192822595874263602839180195139509331520834643669569
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,9,30,34,43,48,71,84,96,121: 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 19, proved: 19 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.