Elliptic Curve Rank Leaderboard

curve #6182

y2 + xy = x3 + x2 − 356181280978227x + 2579091857646540795945
a-invariants
[1, 1, 0, -356181280978227, 2579091857646540795945]
c-invariants
[17096701486954921, -2228335493231872399858325]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
27175971268218999870987545081109578626254
discriminant (Δ)
18425308519852481912529555564992294308600212
Faltings height
7.1621
naive height
112.1330
primes of bad reduction
2, 3, 113, 5309, 8293, 910397360927738869218077930189
regulator
71058349554506336.42207440464898247966125349215260338499782033408975342
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,2,15,24,33,36,40,62,73,87: 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.