Silverman's rank conjecture for elliptic curves in one-parameter families
Let be an elliptic curve over , let denote the elliptic curve over the function field , and let denote its specialization at . Order rational numbers by height. Silverman's conjecture. For almost all , one has
This is presented as a natural analogue of Goldfeld's conjecture for quadratic twists. The supplied text does not state a resolution, so the conjecture is recorded as open.
References
Primary source
Peter Koymans, Carlo Pagano and Efthymios Sofos, “Elliptic fibrations and 3 2^k”, arXiv:2409.02080 (2024).
Additional references
3 papers in this index state this conjecture (2014–2024). The statement above is taken from the most recent of them; the others are arXiv:1710.00294, arXiv:1401.6677.
Progress summary
A February 2025 paper reports the first unconditional example of infinitely many specializations whose rank does not increase, but the general conjecture remains open.
Silverman's conjecture predicts that, in almost every rational specialization of a one-parameter elliptic-curve family, the rank is either the generic rank or exactly one higher. The supplied literature records the conjecture but no general resolution.
Known results
- Silverman's specialization theorem gives for all but finitely many (2004 source).
- A 2022 paper states the expected density formulation outside a density-zero set, with only conditional examples then known.
- The Neumann–Setzer and Legendre families provide conditional examples, respectively assuming Bunyakovsky's conjecture and infinitely many Mersenne primes.
February 2025 unconditional example
A paper reports an unconditional family with generic rank and infinitely many rational specializations of rank . This proves only the weaker existence of infinitely many no-rank-jump fibres, not Silverman's almost-all upper bound for arbitrary families.
Current status (as of August 2026): The specialization lower bound is known and one family has infinitely many no-rank-jump fibres, but Silverman's conjectured upper bound for almost all specializations remains open.
Sources
- arxiv.org
- export.arxiv.org
- ar5iv.labs.arxiv.org
- arxiv.org
- arxiv.org
- web.williams.edu
- quantamagazine.org
- pubs.lib.umn.edu
- dash.harvard.edu
- quantamagazine.org
- mathoverflow.net
- quantamagazine.org
- arxiv.org
- ar5iv.labs.arxiv.org
- mathstodon.xyz
- quantamagazine.org
- mathstodon.xyz
- quantamagazine.org
- quantamagazine.org
Solutions 0
No solutions have been posted yet.