MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A heuristic for boundedness of ranks of elliptic curves

Author(s)
Park, Jennifer; Poonen, Bjorn; Voight, John; Wood, Melanie Matchett
Thumbnail
DownloadAccepted version (706.0Kb)
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
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
Date issued
2019-05
URI
https://hdl.handle.net/1721.1/124997
Department
Massachusetts Institute of Technology. Department of Mathematics
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
ISSN
1435-9855
1435-9863

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.