🔢 mathematics

On the Classification of Weierstrass Elliptic Curves over $\mathbb{Z}_n$

This paper investigates the classification of Weierstrass elliptic curves over the finite ring $\mathbb{Z}_n$ , supported by extensive computational data and the formulation of new conjectures.

Original authors: Param Parekh, Paavan Parekh, Sourav Deb, Manish K Gupta

Published 2026-08-04

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Param Parekh, Paavan Parekh, Sourav Deb, Manish K Gupta

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 world where numbers aren't just tools for counting your allowance or calculating the score of a video game, but are actually the bricks and mortar of a secret, invisible city. This is the realm of number theory, a branch of mathematics that treats numbers like a landscape to be explored. In this landscape, there are special shapes called "elliptic curves." Don't let the fancy name fool you; think of them as magical, looping tracks drawn on a grid. If you place a tiny marble (a point) on the track and follow specific rules to roll it, it will eventually land on another spot on the same track. The magic is that you can combine these spots to create a "group," a mathematical family with its own internal logic.

Why do we care about these looping tracks? Because they are the guardians of our digital secrets. When you send a message on your phone or log into a website, elliptic curves are often the invisible locks keeping your data safe. For a long time, mathematicians have studied these curves on "fields," which are like perfect, smooth grids where every number behaves nicely. But in the real world of computers, we often work with "rings," which are like grids with some missing pieces or sticky spots where numbers get stuck. This paper asks a big question: If we take these magical tracks and draw them on these imperfect, sticky grids (specifically the ring $Z_n$ , which is just the numbers you get when you count around a clock with $n$ hours), what do they look like? How many different types of tracks can we build? And how do we tell if two tracks are actually the same shape, just rotated or flipped?

The authors of this paper, Param Parekh, Paavan Parekh, Sourav Deb, and Manish K Gupta, decided to become cartographers of this sticky-grid world. They didn't just guess; they built a massive digital map using computers to count every single possible track they could draw. They found that while the rules for these tracks on perfect grids are well-known, the rules for the sticky grids are much more complex and interesting.

Here is what they discovered. First, they figured out exactly how to count the total number of non-singular (meaning, no broken or twisted) tracks on these grids. They found a beautiful pattern: the number of these tracks depends on a special function called Euler's totient function, which counts how many numbers on your clock don't get "stuck" when multiplied. For a grid with $n$ hours, the number of reduced tracks (the simplest version of the track) is exactly $\phi(n^2)$ . It's like saying if you have a clock with 5 hours, there are exactly 20 unique simple tracks you can draw.

But knowing how many tracks exist is only half the battle. The real challenge is sorting them into families. Two tracks might look different at first glance, but if you can stretch or twist one to perfectly match the other, they belong to the same "isomorphism class." The authors discovered that the number of these unique families depends heavily on the shape of the clock itself. If the clock has a prime number of hours (like 5, 7, or 11) and that number leaves a specific remainder when divided by 12, the number of families follows a very neat formula, like $2p + 6$ or $2p + 2$ . It's as if the clock's size dictates exactly how many different "families" of tracks can live there.

They also tackled the more complicated "generalized" tracks, which have extra wiggles and turns. They proved that the total number of these complex tracks is $\phi(n^5)$ . However, they hit a wall when trying to find a single, simple formula for the number of unique families of these complex tracks on all types of clocks. They found the answer for some specific types of clocks (like those with a prime number of hours), but for others, especially those with even numbers or multiples of 3, the answer remains a mystery. They explicitly state that finding a compact formula for these remaining cases is an "open problem," meaning even the smartest mathematicians haven't cracked it yet.

To make sure their formulas weren't just pretty math on a page, the authors ran thousands of computer simulations. They wrote code to generate every possible track for small clocks (up to 30 hours for the complex ones and up to 199 hours for the simple ones) and counted them manually. The results matched their formulas perfectly, giving them high confidence in their findings. They even created a public database where anyone can look up the exact number of tracks for any clock size they choose.

In the end, this paper is a massive step forward in understanding the geometry of numbers on imperfect grids. It provides a complete map for the simpler tracks and a partial map for the complex ones, while honestly admitting where the map ends and the unknown territory begins. It shows that even in the rigid world of modular arithmetic, there is a surprising amount of structure and beauty waiting to be discovered, provided you have the right tools and enough patience to count every single possibility.

Technical Summary: On the Classification of Weierstrass Elliptic Curves over $\mathbb{Z}_n$

Problem Statement
While elliptic curves over finite fields ( $\mathbb{F}_q$ ) have been extensively studied and classified, their classification over finite rings, specifically the ring of integers modulo $n$ ( $\mathbb{Z}_n$ ), presents distinct algebraic challenges. The primary difficulty lies in the generalized nature of rings, where finding roots of polynomials and determining isomorphism classes is more complex than in fields. This work addresses the need for a detailed algebraic classification of Weierstrass elliptic curves defined over $\mathbb{Z}_n$ , covering both generalized and reduced models.

Methodology
The authors employ a hybrid approach combining theoretical algebraic derivation with extensive computational verification:

Theoretical Framework: The paper extends known results from finite fields to finite rings. It utilizes the structure of the multiplicative group of units in $\mathbb{Z}_n$ and properties of $k$ -th power residues. A significant portion of the methodology involves analyzing the distribution and multiplicity of $k$ -th power residues (quadratic, cubic, and sixth-order) over prime power moduli ( $\mathbb{Z}_{p^m}$ ).
Algebraic Derivation: The authors derive formulas for the number of non-singular curves, the size of isomorphism classes, and the total number of isomorphism classes. They utilize coordinate transformations ( $\tau$ ) to define isomorphism and automorphism groups ($Aut(E)$).
Computational Validation: A brute-force algorithm implemented in C++ was used to enumerate non-singular curves and classify them into isomorphism classes for various $n$ . The computational data serves to validate the derived theorems and support conjectures. The classification database is made available via a dedicated HTML page.

Key Contributions and Results

Classification of Reduced Weierstrass Curves:
- The paper establishes that for $\mathbb{Z}_{p^m}$ where $\gcd(p, 6)=1$ , the number of non-singular reduced Weierstrass curves is $N_r(\mathbb{Z}_{p^m}) = \phi(p^{2m})$ .
- For composite $n = \prod p_i^{e_i}$ with $\gcd(n, 6)=1$ , the count is multiplicative: $N_r(\mathbb{Z}_n) = \phi(n^2)$ .
- The number of isomorphism classes, $C_r(\mathbb{Z}_{p^m})$ , is determined based on $p \pmod{12}$ , yielding formulas such as $2p^m + 6$ when $p \equiv 1 \pmod{12}$ , and $2p^m$ when $p \equiv 11 \pmod{12}$ .
- An upper bound for the number of non-singular curves is provided for cases where exact counting of singular discriminants is complex, utilizing the distribution of power residues.
Classification of Generalized Weierstrass Curves:
- The number of non-singular generalized Weierstrass curves over $\mathbb{Z}_{p^m}$ is proven to be $N_g(\mathbb{Z}_{p^m}) = \phi(p^{5m})$ .
- For composite $n$ , this extends multiplicatively to $N_g(\mathbb{Z}_n) = \phi(n^5)$ .
- The number of curves isomorphic to a given curve $E_k$ is given by $N^{(k)}_g(\mathbb{Z}_n) = \phi(n^4)/|Aut(E)|$ .
Power Residue Analysis:
- The authors derive new theorems regarding the multiplicity of $k$ -th power residues in $\mathbb{Z}_{p^m}$ . They categorize residues into classes based on their divisibility by $p$ and provide recursive formulas for their multiplicities.
- A generalized Euler's criterion is proposed for non-unit elements in $\mathbb{Z}_{p^m}$ to determine if they are $k$ -th power residues.
Computational Data:
- Extensive tables are provided validating the theoretical counts for $N_r(\mathbb{Z}_n)$ , $C_r(\mathbb{Z}_n)$ , $N_g(\mathbb{Z}_n)$ , and $C_g(\mathbb{Z}_n)$ for various $n$ (up to $n=30$ for generalized and $n=199$ for reduced curves).
- A complete classification of isomorphism classes for $\mathbb{Z}_5$ is presented, detailing class leaders, automorphism group orders, and the number of curves per class.

Significance and Open Problems
The paper claims to provide the fundamental classification of Weierstrass elliptic curves over finite rings, highlighting a structural parallelism between the field and ring settings where the cardinality $q$ is replaced by Euler's totient function $\phi(n)$ .

The authors explicitly identify the following as open problems:

Compact Formula for Generalized Classes: A closed-form formula for the number of isomorphism classes of generalized Weierstrass curves, $C_g(\mathbb{Z}_n)$ , is currently unknown for several cases, including $n=2^m$ , $n=3^m$ , and composite $n$ where $\gcd(n, 6) \neq 1$ .
Hasse-Weil Bound: The paper suggests it would be interesting to establish a Hasse-Weil-like bound on the number of points of an elliptic curve over $\mathbb{Z}_n$ , though this is not achieved in the current work.

The work concludes that while the classification for reduced curves over $\mathbb{Z}_n$ (where $\gcd(n,6)=1$ ) is now well-defined, the generalized case and cases involving characteristics 2 and 3 remain areas for future research.

More like this