← Latest papers
🔢 mathematics

Local statistics and average rank of genus gg hyperelliptic curves with a Weierstrass point

This paper establishes probability formulas for various reduction types of genus gg hyperelliptic curves with a Weierstrass point over number fields and, under standard conjectures, derives an explicit upper bound for their average analytic rank.

Original authors: Keunyoung Jeong, Junyeong Park

Published 2026-07-15
📖 5 min read🧠 Deep dive

Original authors: Keunyoung Jeong, Junyeong Park

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 a vast, cosmic garden filled with millions of different kinds of plants called hyperelliptic curves. These aren't your average garden flowers; they are complex, multi-dimensional shapes defined by specific mathematical recipes. Some of these plants have a special "Weierstrass point," which you can think of as a unique, glowing seed that anchors the whole structure.

Mathematicians Keunyoung Jeong and Junyeong Park decided to take a census of this garden. They wanted to answer two big questions: First, if you pick one of these plants at random, what are the odds it will look "perfect" (smooth and healthy) when you zoom in on a specific spot? Second, on average, how "twisted" or complex are these plants?

The Health Check: Good vs. Bad Reduction

To understand the first question, imagine you are a botanist checking the soil quality at a specific location in the garden. In the world of these curves, the "soil" is a prime number (let's call it pp). The researchers found that if the soil is rich enough (specifically, if the prime number is larger than 2g+12g + 1, where gg is the "genus" or complexity of the curve), you can predict the plant's health with surprising precision.

They discovered that most of these plants are incredibly robust. If you pick a random curve with a Weierstrass point, there is a very high probability—specifically, a chance that looks like 11q1 - \frac{1}{q} (where qq is the size of the soil's residue field)—that the plant will be in "good reduction." This means it stays smooth and doesn't break apart when you look at it through the lens of that prime number.

However, sometimes the soil causes the plant to develop a "knot" or a "singularity." The paper categorizes these knots into three types, much like how a knot in a rope can be a simple loop, a tight twist, or a messy tangle:

  1. Abelian Rank (aa): The plant stays mostly intact, just losing a little bit of its "toric" or "unipotent" flexibility.
  2. Toric Rank (tt): The plant develops a specific kind of loop (like a multiplicative reduction in simpler curves).
  3. Unipotent Rank (uu): The plant gets a messy tangle (like an additive reduction).

The authors calculated the exact odds for these different outcomes. For example, the chance of a plant having a "toric" knot (a specific type of loop) is roughly q1q+1×1q2g\frac{q-1}{q+1} \times \frac{1}{q^{2g}}. They even worked out the odds for more complex scenarios, like a plant having a "tacnode" (a very specific type of double-point knot), which happens with a probability of q1q4(1q20)\frac{q-1}{q^4(1-q^{-20})} for genus 2 curves.

What they ruled out: The paper is very careful to say that these probabilities are for curves with a Weierstrass point. They explicitly note that if you try to apply their formulas for "additive reduction" (the messy tangle) in the simplest case (genus 1, which is just an elliptic curve), the math breaks down because the "reduction map" lands in a weird, exceptional spot that doesn't behave like the others. So, their general formula doesn't work for that one specific, tiny case without adjustment.

The Twistiness: Average Analytic Rank

The second part of their adventure is about measuring the "twistiness" of these plants. In math, this is called the analytic rank. Think of it as a score that tells you how many independent loops or cycles exist within the plant's structure. A higher score means a more complex, twisted plant.

The authors wanted to know: "If we look at the entire garden of these curves, what is the average twistiness score?"

To get this answer, they had to make some big assumptions. They assumed two famous, unproven (but widely believed) mathematical ideas: the Hasse–Weil conjecture and the Generalized Riemann Hypothesis. These are like assuming the laws of physics hold true in a parallel universe to make the math work.

Under these assumptions, they proved a strict upper limit. They found that the average analytic rank for these curves over a number field KK (which has a degree DD) is bounded above by:

12+3g(2g+1)D2 \frac{1}{2} + \frac{3g(2g+1)D}{2}

This is a concrete, proven ceiling. It means that no matter how many curves you pick, the average twistiness cannot exceed this number.

How sure are they?
The paper is very confident in the upper bound. They didn't just guess; they derived an explicit formula. However, they acknowledge that this is an upper limit, not the exact average. They mention that, based on the "Katz–Sarnak philosophy" (a guiding principle in the field), they expect the true average to be exactly 12\frac{1}{2}. But their paper only proves it is less than or equal to the formula above.

They also point out that while other mathematicians (Bhargava and Gross) found a tighter bound of 32\frac{3}{2} for curves over the rational numbers (Q\mathbb{Q}), Jeong and Park's result is special because it works for any number field, not just the rational ones.

The Bottom Line

Jeong and Park have mapped out the statistical landscape of these complex curves. They showed us that:

  1. Most are healthy: The vast majority of these curves stay smooth when viewed through the lens of large prime numbers.
  2. Knots are predictable: If they do develop knots, we know exactly how likely each type of knot is.
  3. Twistiness has a limit: Assuming standard mathematical hypotheses, the average complexity of these curves is capped at a specific number that depends on the curve's genus and the field it lives in.

They haven't solved the mystery of the exact average (which they suspect is 0.5), but they have built a very sturdy fence around it, proving it can't get too wild.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →