Elliptic Curve Rank Leaderboard

curve #6168

y2 + xy + y = x3 − 51645574017006922559x + 114359963314028339882885488382
a-invariants
[1, 0, 1, -51645574017006922559, 114359963314028339882885488382]
c-invariants
[2478987552816332282809, -98807008307038966988037560386477]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
47290188619362468646572850422665780847445759150230
discriminant (Δ)
3166373766936588196103418564163447860905381658541344486365700
Faltings height
10.3240
naive height
147.7864
primes of bad reduction
2, 3, 5, 43, 293, 673, 724802984897, 256494866860501002324469233539
regulator
146091460021831548521769.66548677958100218584635743082784575155171672377621
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,3,17,22,24,33,51,66,84,120: 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 18, proved: 18 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.