Counting odd genus $2$ curves with a marked rational $3$-torsion point
This paper establishes the asymptotic count, ordered by naive height, of genus 2 curves over the rationals that possess a monic Weierstrass model of odd degree and a Jacobian with a marked rational 3-torsion point.
Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer
Imagine you are a detective trying to count a very specific type of invisible treasure: genus 2 curves. In the world of math, these are fancy, wiggly shapes defined by equations. But we aren't just counting any shape; we are hunting for ones that have two special "superpowers":
- They must be built from a specific kind of equation (a "monic Weierstrass model of odd degree").
- Their hidden "Jacobian" (a complex mathematical machine attached to the curve) must have a specific, marked "3-torsion point." Think of this point as a secret handshake that repeats exactly three times before returning to zero.
The authors, Elvira Lupoian and Lazar Radičević, wanted to know: If we look at all these special curves, how many are there as we get bigger and bigger?
The Great Counting Machine
To answer this, the authors had to build a massive, custom-made counting machine. Usually, counting these shapes is like trying to count grains of sand on a beach where the grains keep changing size and shape. It's messy.
But the authors discovered a clever trick. They found a way to translate every single one of these special curves into a set of four numbers, which they called A, B, J, and E. It's like realizing that every unique snowflake can be described by just four specific measurements.
They built a giant, invisible box (mathematicians call it a "weighted projective space") to hold these four numbers. The size of the box is controlled by a number called X, which acts like a magnifying glass. As you turn the dial on X to make the box bigger, you can fit more and more of these four-number sets inside.
The Big Discovery
The paper's main finding is a precise prediction of how many curves fit in the box as X gets huge.
The authors proved that the number of these curves, which they call #Wmark(X), grows at a rate of X¹⁰.
That's right: X to the power of 10.
If you double the size of your magnifying glass (X), the number of curves doesn't just double; it explodes by a factor of 1,024 (since ). The formula they found is:
#Wmark(X) = cX¹⁰ + o(X¹⁰)
Here, c is a specific, positive number that the authors calculated. It's made up of the volume of their special box and some "local density" factors (like how crowded the numbers are at specific prime numbers like 2 and 3). The term o(X¹⁰) is a mathematical way of saying "a tiny, insignificant leftover amount that disappears as the numbers get huge."
What They Ruled Out
The authors were very careful to say what their method doesn't do.
- They explicitly ruled out the idea that this is just a guess or a simulation. They didn't just run a computer program to count a few examples and guess the pattern. They proved the formula using deep geometry and number theory.
- They also clarified that this count is for curves with a marked point. If you forget the mark and just count the curves, the number is roughly half as big (because the point and its "negative" twin look the same if you don't label them).
- They noted that curves with a bigger group of 3-torsion points (specifically a group of order 9) are so rare they are practically invisible in this count—they are a "thin subset" that doesn't change the main formula.
How Sure Are They?
The authors are 100% sure about the shape of the answer. They didn't say "it looks like" or "we think." They proved that the number of curves follows the cX¹⁰ pattern exactly.
They did admit that calculating the exact value of the constant c is a bit of a chore. It involves a lot of heavy lifting with computer algebra systems (they used a program called MAGMA to do the math) to figure out the exact volume of their box and the density of the numbers. While they gave the formula for c, actually crunching the final decimal number is described as "tedious," but the existence of the number and the X¹⁰ growth rate are solid, proven facts.
The "Why It Matters" (Without the Jargon)
Why spend so much time counting these invisible, wiggly shapes?
The authors explain that counting these curves is like solving a puzzle about how numbers behave in complex systems. While we know a lot about simple curves (like circles or ellipses), the rules get much fuzzier for these "genus 2" shapes.
This paper is a breakthrough because it's the first time anyone has found an exact formula for counting these specific shapes when the "map" of all possible shapes isn't just a simple line or curve, but a much more complicated, multi-dimensional space. They managed to tame a wild, high-dimensional jungle and draw a precise map of how the trees are distributed.
In short: They found a way to count a specific, rare type of mathematical shape, proved that the count grows incredibly fast (like X¹⁰), and gave a precise formula for exactly how many there are. It's a victory for the geometry of numbers, turning a chaotic mess into a clean, predictable pattern.
Drowning in papers in your field?
Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.