← Latest papers
🔢 mathematics

Rational torsion on hyperelliptic jacobian varieties

This paper proves the existence of parametric families of hyperelliptic Jacobian varieties over Q\mathbb{Q} with rational torsion points of order NN for specific values in the interval [3g,4g+1][3g, 4g+1], thereby providing the first known infinite examples of such varieties for various torsion orders including 13, 15, 17, 18, and 21.

Original authors: Hamide Suluyer, Mohammad Sadek

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

Original authors: Hamide Suluyer, Mohammad Sadek

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 the world of math as a giant, cosmic playground where shapes called "curves" dance around. Some of these curves are simple loops, but others are wild, twisting hyperelliptic curves that look like pretzels made of infinite possibilities. Hidden inside these curves are secret treasures called "torsion points." Think of these points as special keys. If you use a key to unlock a door (the curve's Jacobian, which is like the curve's internal engine room) and turn it exactly NN times, you end up back where you started, as if you never moved at all.

For a long time, mathematicians were trying to figure out how big these keys could get. They knew that for simple, one-humped curves (genus 1), the keys had a strict size limit. But for the more complex, multi-humped curves (genus g2g \ge 2), the rules were fuzzy. A mathematician named Flynn made a bold guess: he thought there was a magic constant, let's call it κ\kappa, that acted like a ruler. He guessed that for any curve with gg humps, you could find a key of size NN as long as NN was smaller than κ\kappa times gg. Another researcher, Leprévost, proved this was true, but only if the key was no bigger than 3g3g. It was like saying, "We can find keys up to size 30 for a 10-hump curve, but maybe not bigger."

But here's the twist: the space between 3g3g and the much larger, quadratic limits (where keys could be as big as g2g^2) was a dark, unexplored canyon. No one knew if keys existed in that gap.

Enter Mohammad Sadek and Hamide Suluyer. They decided to build a bridge across that canyon. They didn't just guess; they constructed a factory.

The Factory of Infinite Curves
The authors built a parametric family of curves. Imagine a giant 3D printer that can print out an infinite number of these hyperelliptic curves. By tweaking the dials (which are just variables like ss, tt, and uu), they could print curves with specific properties.

Their main discovery is a new set of rules for the size of the keys. They proved that for any curve with at least 3 humps (g3g \ge 3), they can create a family of curves that has a key of size NN, provided NN falls in the range between 3g3g and 4g+14g + 1.

To make this concrete, they showed they could print:

  • Curves with 3 humps (g=3g=3) that have a key of size 13.
  • Curves with 4 humps (g=4g=4) that have a key of size 15.
  • Curves with 5 humps (g=5g=5) that have keys of size 17, 18, and 21.

These aren't just one-off lucky finds. The paper proves there are infinitely many different, non-identical curves for each of these sizes. It's like saying, "We can print an endless supply of 3-hump curves, and every single one of them will have a key of size 13."

How They Did It: The Magic of Fractions
How did they find these keys? They used a mathematical tool called "continued fractions." Imagine you are trying to describe a number by breaking it down into a chain of smaller and smaller fractions. Usually, this chain goes on forever. But for these special curves, the chain starts repeating itself, like a song with a catchy chorus.

The authors discovered a deep link: if the chain of fractions repeats in a specific, symmetrical pattern (which they call "skew symmetric"), then the curve has a torsion point. The size of the key (NN) is determined by adding up the lengths of the pieces in that repeating pattern. By carefully designing the curve so that the fraction chain repeats in just the right way, they forced the curve to have a key of the exact size they wanted.

What They Didn't Do (and What They Didn't Claim)
It's important to note what this paper doesn't say. They didn't prove that keys of every size exist, only those in that specific 3g3g to 4g+14g+1 range. They also didn't claim to have found the absolute maximum possible key size for these curves; they just pushed the boundary further than anyone else had before.

Furthermore, they didn't just simulate these curves on a computer and hope for the best. They used rigorous algebra to prove that these families exist. They even checked that many of these curves are "absolutely simple," meaning their internal engines are so complex they can't be broken down into smaller, simpler machines. This is a strong, proven fact, not a guess.

The Bottom Line
Sadek and Suluyer have filled a gap in the map of mathematical treasures. They showed that the "forbidden zone" between 3g3g and 4g+14g+1 is actually full of hidden keys. They built a machine that can generate an infinite supply of these curves, proving that for odd numbers of humps, you can get a key of size 4g+14g+1, and for even numbers, you can get a key of size 4g14g-1.

So, the next time you hear about a 5-humped curve, remember: thanks to this work, we know for a fact that there are infinitely many of them hiding a secret key of size 21, waiting to be discovered.

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 →