Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. A heuristic for boundedness of ranks of elliptic curves

A heuristic for boundedness of ranks of elliptic curves

Thumbnail Image
Download
Name

bounded-ranks.pdf

Description
Accepted version
Size

706.04 KB

Format

Adobe PDF

Checksum (MD5)

f6521a16caf0a4b697c012af103625e3

sword-2019-11-18T17:57:52.original.xml (130 B)
Original SWORD entry document
Author(s)
Park, Jennifer
•
Poonen, Bjorn
•
Voight, John
•
Wood, Melanie Matchett
Date Issued
May 2019
Journal
Journal of the European Mathematical Society
Publisher
European Mathematical Society Publishing House
Citation
Park, Jennifer, et al. “A Heuristic for Boundedness of Ranks of Elliptic Curves.” Journal of the European Mathematical Society 21, 9 (May 2019): 2859–903.
Version
Author's final manuscript
Abstract
We present a heuristic that suggests that ranks of elliptic curves E over Q are bounded. In fact, it suggests that there are only finitely many E of rank greater than 21. Our heuristic is based on modeling the ranks and Shafarevich-Tate groups of elliptic curves simultaneously, and relies on a theorem counting alternating integer matrices of specified rank. We also discuss analogues for elliptic curves over other global fields. Keywords: Elliptic curve; rank; Shafarevich–Tate group
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/124997
DOI of Published Version
https://doi.org/10.4171/jems/893
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.