🔢 mathematics

The Dimension of the Moduli Space of Pointed Algebraic Curves of Low Genus

This paper explicitly computes the moduli space of pointed algebraic curves with a specified Weierstrass semigroup for many cases of genus up to seven and determines the dimension for all such semigroups of genus seven.

Original authors: Jan Stevens

Published 2026-06-03

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Jan Stevens

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 an architect trying to design a specific type of building. In the world of mathematics, these "buildings" are called algebraic curves (think of them as smooth, looping shapes drawn on a piece of paper).

This paper is about a very specific challenge: How many different ways can you build these curves if you force them to have a specific "flaw" or "feature" at one single point?

Here is the breakdown of the paper's journey, using everyday analogies:

1. The "Weierstrass Semigroup": The Building's Blueprint

Every smooth curve has a special point on it. If you look at the mathematical functions that describe the curve, they might have "poles" (places where they shoot off to infinity) at this point.

The Analogy: Imagine the curve is a rollercoaster. The "Weierstrass semigroup" is a list of all the specific heights the rollercoaster can reach at a specific station. Some heights are impossible (these are called "gaps"), and some are possible.
The Goal: The author wants to know: If I tell you the list of impossible heights (the gaps), how many different rollercoasters can I build that fit this description?

2. The "Monomial Curve": The Crumpled Prototype

To solve this, the author doesn't look at the smooth rollercoaster immediately. Instead, they look at a "monomial curve."

The Analogy: Think of the smooth curve as a perfectly polished marble statue. The monomial curve is the rough, crumpled clay lump you get before you polish it. It has a sharp, ugly point in the middle (a singularity).
The Connection: The paper uses a famous mathematical trick (by Pinkham) that says: To understand the smooth statue, you just need to study how you can smooth out the rough clay lump.

3. The "Deformation": Smoothing the Clay

The core of the paper is about deformation. This is the process of taking that rough clay lump and gently pushing and pulling it until it becomes smooth, while keeping the "blueprint" (the semigroup) the same.

The Challenge: Sometimes, the clay is so crumpled that there are thousands of ways to smooth it out. Sometimes, the math gets so messy that the equations describing these ways become incredibly long and complicated (like a recipe with 20,000 ingredients).
The "Negative Weight" Rule: The author focuses on a specific type of smoothing process (called "negative weight") which acts like a filter, keeping only the most relevant ways to smooth the curve.

4. The "Moduli Space": The Map of All Possibilities

The result of this smoothing process is a "Moduli Space."

The Analogy: Imagine a giant map. Every single point on this map represents a unique, smooth curve that fits your blueprint.
- If the map is a single dot, there is only one way to build the curve.
- If the map is a long line, there is a line's worth of possibilities.
- If the map is a huge, complex shape (like a cone or a multi-dimensional blob), there are many possibilities.
The Paper's Achievement: The author calculated the size (dimension) of this map for almost every possible blueprint where the "gap count" (genus) is 7 or less.

5. The Methods: Three Different Tools

The author had to use three different "tools" to solve this puzzle because the clay got too messy for just one tool:

The Standard Computer Method: Using powerful software (like Singular) to crunch the numbers. This worked for the simpler curves but got stuck on the complex ones because the equations became too huge.
Hauser's Algorithm (The "Perturbation" Method): Instead of solving the whole problem at once, this method slightly "tweaks" the equations in every possible way, then checks which tweaks actually work. It's like trying every key on a giant keyring to see which one opens the door.
The Projection Method: This involves squashing the 3D curve down onto a 2D plane to make it easier to study, solving the problem there, and then "un-squashing" the answer back to 3D.

6. The Big Discovery

The paper found a very satisfying pattern:

The Lower Bound Rule: Mathematicians had a guess (a formula) for the minimum size of the map of possibilities. The author proved that for all these curves (genus 7 or less), the map is exactly that minimum size. It's never bigger than expected.
The Shapes of the Maps:
- For simple curves, the map is a smooth, flat space (easy to navigate).
- For medium curves, the map looks like a cone sitting on top of a shape called a "Segre embedding" (think of a pyramid with a very specific, twisted base).
- For the trickiest curves, the maps get weird, sometimes splitting into two separate pieces or looking like cones over complex shapes called "Grassmannians."

7. The "One Case" Where History Was Wrong

The paper mentions a famous mathematician named Haure who did similar work a long time ago. Haure calculated the number of possibilities for these curves.

The Twist: The author found that Haure was right for almost every case, except one. For one specific blueprint (semigroup N(7)10), Haure thought there were 11 possibilities, but the author proved there are actually 12. This is the only correction the paper makes to the historical record.

Summary

In short, this paper is a massive cataloging project. The author took a complex mathematical puzzle about the shapes of curves, used a mix of computer power and clever mathematical shortcuts to "smooth out" the rough edges, and successfully mapped out exactly how many different versions of these curves exist for small, manageable sizes. They proved that the universe of these curves is more orderly than previously thought, following a strict "minimum size" rule.

Technical Summary: The Dimension of the Moduli Space of Pointed Algebraic Curves of Low Genus

Problem Statement
The paper addresses the computation of the dimension and structure of the moduli space $M^{\Gamma}_{g,1}$ , which parametrizes pointed smooth algebraic curves of genus $g$ with a specified Weierstrass semigroup $\Gamma$ at the marked point. While the non-emptiness of these spaces for $g \leq 7$ was established by Komeda, and their irreducibility and rationality were shown by Bullock for many cases, the explicit determination of their dimension and geometric structure remained incomplete. Specifically, the author aims to compute the dimension of $M^{\Gamma}_{g,1}$ for all numerical semigroups of genus at most seven and to describe the structure of the space where feasible.

Methodology
The approach relies on the foundational result by Pinkham, which establishes an isomorphism between $M^{\Gamma}_{g,1}$ and the quotient of the negative weight part of the versal deformation space of the associated monomial curve singularity $C_{\Gamma}$ by the $\mathbb{G}_m$ -action. The paper employs three primary computational strategies to determine these deformation spaces:

Standard Approach (Singular): Utilizing the computer algebra system Singular and the deform.lib package, the author computes infinitesimal deformations and lifts them order-by-order to find the versal deformation. This involves resolving the ideal of the monomial curve and lifting the relation matrix. However, this method often encounters computational limits regarding time and the complexity of resulting equations for higher genera.
Hauser's Algorithm: To overcome the limitations of the standard approach, the paper employs Hauser's algorithm (and the related Contiero-Stöhr method). This involves perturbing the defining equations of the curve in the most general way (a semi-universal unfolding) and subsequently determining the locus in the parameter space where the deformation is flat. This method introduces many variables which are later eliminated, often yielding fewer but more complex equations.
Projection Method: For specific cases where other methods are intractable, the author uses the projection method developed by De Jong and Van Straten. This technique reconstructs the curve singularity from a plane curve projection and a fat point subscheme, solving deformation equations via normal modules. This method is particularly effective for curves with $I_2$ -equivalent plane projections.

Key Contributions and Results

Dimension Formula: The primary result is the explicit computation of the dimension of $M^{\Gamma}_{g,1}$ for all numerical semigroups of genus $g \leq 7$ . The author proves that for all such semigroups, the dimension is given exactly by the lower bound established by Rim and Vitulli:
$\dim M^{\Gamma}_{g,1} = 2g - 2 + t - \dim T^1_{+}$
where $t$ is the type of the semigroup (rank of the highest syzygy module) and $\dim T^1_{+}$ is the dimension of the space of positive weight infinitesimal deformations. This confirms that the lower bound is sharp for this range of genera.
Structural Classification: The paper provides a detailed classification of the geometric structure of $M^{\Gamma}_{g,1}$ for various semigroups:
- Smooth Base Spaces: For many cases (e.g., complete intersections, Gorenstein curves of codimension 3, Cohen-Macaulay curves of codimension 2), the base space is smooth.
- Segre Cones: For codimension 3 curves with type $t=3$ , the base space is frequently the cone over the Segre embedding of $\mathbb{P}^1 \times \mathbb{P}^3$ . Exceptions are identified where the base space consists of two components (e.g., $N(6)_8$ and $N(7)_{10}$ ).
- Grassmannian Cones: For specific Gorenstein curves (e.g., $N(6)_{22}$ and $N(7)_{26}$ ), the base space is identified as the cone over the Grassmannian $G(2,5)$ .
- Complex Structures: For curves with higher codimension and type (e.g., $N(6)_{20}$ and $N(7)_{25}$ ), the base space exhibits a structure denoted as $G'$ , defined by specific sets of equations derived via Hauser's algorithm.
- High Complexity Cases: For semigroups with 5 generators and type 4, the base spaces are generally complex. While explicit equations are provided for $N(4)_7$ and $N(6)_{12}$ (using the projection method), the author notes that for other cases (marked with '?' in the tables), the equations are too complicated to be useful in their current form, though the dimension is still determined.
Correction of Previous Literature: The author corrects a result by Haure regarding the number of moduli for the semigroup $N(7)_{10}$ , showing that the dimension is 12, whereas Haure's plane model suggested 11.

Significance and Claims
The paper claims to extend the explicit computations of Nakano to all semigroups of genus seven. By systematically applying deformation theory and computer algebra, the author establishes that the lower bound for the dimension of the moduli space is the exact dimension for all cases with $g \leq 7$ . The work highlights the limits of current computational methods, noting that while dimensions can be determined, the explicit equations for the base spaces in higher codimension cases often become too unwieldy (involving thousands of monomials) to provide a clear geometric picture. The paper serves as a definitive reference for the dimensions and structural types of these moduli spaces in low genus, relying on the connection between pointed curves and monomial curve singularities.