This morning, a mysterious user named "ranksunbounded" submitted the linked curve, which has rank at least thirty. This breaks the previous record of 29 found by Elkies and Klagsbrun in 2024.
Nobody knows whether it is possible to achieve arbitrarily high ranks.
Hehe, I really like them. And I always recommend those. It's not always that you have some nice books on deep concepts in mathematics for the "general" public
I spent 20 minutes trying to learn what this means as someone who hasn’t taken a ton of college math. Please feel free to correct me/treat this as a teaching opportunity. But I think this is just stuff that can be understood with just algebra, just the numbers are very very large.
It sounds like the big deal is you have at least 30 points in a graph that aren’t related and can be expressed as rational numbers (not necessarily integers so you get giant fractions). Being very humble here and invite people more advanced in mathematics to chime in where I’m wrong.
So like this is one of the x,y coordinate points that is two rational numbers.
So there’s at least 30 points on the graph like this, which is a big deal because before there were only 29 independent points verified in any elliptic curve equation.
“Independent” seems to mean something precise here too but I’ll let someone else explain that because I’m not quite sure, somehow the points have to be unrelated to one another.
Bumping the rank from 28->29 previously took over ten years, so it’s a big deal in mathematics apparently.
The rank of an elliptic curve is expected to be at most one by a combination of a simple heuristic from Cohen and Lenstra and a deep BSD consequence (but I think the case needed is known). However we know of families with rank 15, and sometimes those ranks go up at particular points.
The record before this morning was 29 and people suspected that was as high as it got. When we learn how this curve was obtained that might change.
> The record before this morning was 29 and people suspected that was as high as it got.
Exactly this. A fundamental question in the subject is, whether elliptic curve ranks are bounded. Contrast with e.g. prime numbers, of which are known to be infinitely many. If you set a new record for the largest known prime, then that's cool but everyone knew there were plenty out there to discover.
made a significant impact in the field, coming up with a heuristic argument for why ranks of elliptic curves should be bounded. The same heuristic suggests, albeit more loosely, that we should perhaps be a little bit surprised to see a curve with rank at least 30. So it's mild evidence that the heuristic itself could be mistaken.
BSD == Birch and Swinnerton-Dyer I think? I am also uninitiated. I enjoy learning about the millennium prize problems but BSD is one I don’t have a very good understanding of.
The rank of a rational elliptic curve can be seen as a measure of how complex its arithmetic structure is. Roughly speaking, you can imagine that a curve of rank r has a substructure of dimension r. So a curve with a high rank is a pretty exotic object. This curve here has a 30-dimensional (or greater) lattice substructure. You can think of it as being possible to arrange the rational points on this curve into a predictable structure in a vector space of dimension at least 30. In that space, there would be at least thirty independent directions in space that could be combined together to produce distinct rational points on the curve.
To really quantify how exotic, it's conjectured that curves with rank 2 or greater have an asymptotic density of zero. That doesn't mean they don't or can't exist, but it does mean they become vanishingly rare, so finding even individual examples of high-rank curves has been absurdly hard.
I'm the maintainer of the linked website.
This morning, a mysterious user named "ranksunbounded" submitted the linked curve, which has rank at least thirty. This breaks the previous record of 29 found by Elkies and Klagsbrun in 2024.
Nobody knows whether it is possible to achieve arbitrarily high ranks.
Want to understand this more? Read the triplet of books by Ash and Gross, specially Elliptical Tales
Hehe, I really like them. And I always recommend those. It's not always that you have some nice books on deep concepts in mathematics for the "general" public
Can we have a tldr of the implications of this for the uninitiated?
I spent 20 minutes trying to learn what this means as someone who hasn’t taken a ton of college math. Please feel free to correct me/treat this as a teaching opportunity. But I think this is just stuff that can be understood with just algebra, just the numbers are very very large.
It sounds like the big deal is you have at least 30 points in a graph that aren’t related and can be expressed as rational numbers (not necessarily integers so you get giant fractions). Being very humble here and invite people more advanced in mathematics to chime in where I’m wrong.
So like this is one of the x,y coordinate points that is two rational numbers.
x=30786757706172245427369935940751/4
y=58841476683002984849182029306774218124047405249/8
So there’s at least 30 points on the graph like this, which is a big deal because before there were only 29 independent points verified in any elliptic curve equation.
“Independent” seems to mean something precise here too but I’ll let someone else explain that because I’m not quite sure, somehow the points have to be unrelated to one another.
Bumping the rank from 28->29 previously took over ten years, so it’s a big deal in mathematics apparently.
The rank of an elliptic curve is expected to be at most one by a combination of a simple heuristic from Cohen and Lenstra and a deep BSD consequence (but I think the case needed is known). However we know of families with rank 15, and sometimes those ranks go up at particular points.
The record before this morning was 29 and people suspected that was as high as it got. When we learn how this curve was obtained that might change.
> The record before this morning was 29 and people suspected that was as high as it got.
Exactly this. A fundamental question in the subject is, whether elliptic curve ranks are bounded. Contrast with e.g. prime numbers, of which are known to be infinitely many. If you set a new record for the largest known prime, then that's cool but everyone knew there were plenty out there to discover.
This paper, by leading experts,
https://arxiv.org/abs/1602.01431
made a significant impact in the field, coming up with a heuristic argument for why ranks of elliptic curves should be bounded. The same heuristic suggests, albeit more loosely, that we should perhaps be a little bit surprised to see a curve with rank at least 30. So it's mild evidence that the heuristic itself could be mistaken.
BSD == Birch and Swinnerton-Dyer I think? I am also uninitiated. I enjoy learning about the millennium prize problems but BSD is one I don’t have a very good understanding of.
The rank of a rational elliptic curve can be seen as a measure of how complex its arithmetic structure is. Roughly speaking, you can imagine that a curve of rank r has a substructure of dimension r. So a curve with a high rank is a pretty exotic object. This curve here has a 30-dimensional (or greater) lattice substructure. You can think of it as being possible to arrange the rational points on this curve into a predictable structure in a vector space of dimension at least 30. In that space, there would be at least thirty independent directions in space that could be combined together to produce distinct rational points on the curve.
To really quantify how exotic, it's conjectured that curves with rank 2 or greater have an asymptotic density of zero. That doesn't mean they don't or can't exist, but it does mean they become vanishingly rare, so finding even individual examples of high-rank curves has been absurdly hard.