Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Heuristics for the arithmetic of elliptic curves
This is not the latest version of this item. The latest version can be found here.

Heuristics for the arithmetic of elliptic curves

Thumbnail Image
Download
Name

icm2018.pdf

Description
Accepted version
Size

506.08 KB

Format

Adobe PDF

Checksum (MD5)

9ddec1191528f860534d016f239aa961

sword-2021-05-25T18:31:48.original.xml (130 B)
Original SWORD entry document
Author(s)
Poonen, B
Date Issued
2018
Journal
Proceedings of the International Congress of Mathematicians, ICM 2018
Citation
Poonen, B. 2018. "Heuristics for the arithmetic of elliptic curves." Proceedings of the International Congress of Mathematicians, ICM 2018, 2.
Version
Author's final manuscript
Abstract
© Proceedings of the International Congress of Mathematicians, ICM 2018. All rights reserved. This is an introduction to a probabilistic model for the arithmetic of elliptic curves,a model developed in a series of articles of the author with Bhargava, Kane, Lenstra,Park, Rains, Voight, and Wood. We discuss the theoretical evidence for the model, andwe make predictions about elliptic curves based on corresponding theorems provedabout the model. In particular, the model suggests that all but finitely many ellipticcurves over Q have rank - 21, which would imply that the rank is uniformly bounded.
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/137151
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.