Papers
Topics
Authors
Recent
Search
2000 character limit reached

A heuristic for boundedness of ranks of elliptic curves

Published 3 Feb 2016 in math.NT | (1602.01431v3)

Abstract: We present a heuristic that suggests that ranks of elliptic curves over the rationals are bounded. In fact, it suggests that there are only finitely many elliptic curves 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.

Citations (65)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 5 tweets with 48 likes about this paper.