🔢 mathematics

Weierstrass semigroups at totally ramified places of degree one on linearized function fields

This paper provides a unified description of the Weierstrass semigroups at totally ramified places of degree one in linearized function fields, explicitly determining their generators, multiplicity, Frobenius number, and symmetry conditions, while also analyzing minimal generating sets for multiple such places and applying these results to specific examples.

Original authors: Huachao Zhang, Chang-An Zhao

Published 2026-05-29

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Huachao Zhang, Chang-An Zhao

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 exploring a vast, magical landscape called a Function Field. In this world, there are special locations called Places. Some of these places are like bustling city centers (rational places), while others are remote, isolated villages.

This paper is a map-making expedition. The authors, Zhang and Zhao, are focusing on a very specific type of terrain: Linearized Function Fields. Think of these as landscapes built according to a strict, rhythmic rule (a "linearized" rule) that connects two variables, $x$ and $y$ , in a very particular way.

Here is the breakdown of their journey, explained simply:

1. The Goal: Mapping the "Gaps"

In this mathematical landscape, there are numbers that represent how "tall" or "powerful" a function can be at a specific location. Most numbers are allowed, but some are forbidden. These forbidden numbers are called Gaps.

The Analogy: Imagine a ladder where most rungs exist, but a few are missing. The missing rungs are the "Gaps." The highest missing rung is called the Frobenius Number.
The Problem: For a long time, mathematicians knew how to find these missing rungs for simple landscapes. But for these specific "Linearized" landscapes, especially at the most isolated spots (called totally ramified places), the map was incomplete.

2. The Discovery: A Unified Map

The authors successfully drew a complete, unified map of these missing rungs (the Gaps) for these specific locations.

What they found: They didn't just list the missing numbers; they found the pattern behind them. They discovered a formula that tells you exactly which numbers are missing and which are present.
The "Generators": Think of the allowed numbers (the rungs that do exist) as a building set. You don't need every single rung to build the whole ladder; you just need a few key "starter" rungs. The authors identified exactly which starter rungs are needed to build the entire structure of allowed numbers.
Symmetry: They also figured out when the landscape is perfectly balanced (symmetric). In a symmetric landscape, the pattern of missing rungs is a perfect mirror image of the allowed ones. They gave a clear "yes or no" test to see if a specific location has this perfect balance.

3. The Team Effort: Multiple Locations

The paper doesn't just look at one isolated village; it looks at groups of them.

The Challenge: When you have multiple locations (say, three villages), the "gaps" become more complex. Instead of a single list of missing numbers, you now have a multi-dimensional puzzle (like a grid of missing spots).
The Solution: The authors found the Minimal Generating Set. This is the smallest, most efficient list of "starter moves" needed to describe the rules for all these locations at once.
The Magic Trick: They didn't just list the numbers; they actually wrote down the functions (the mathematical spells) that create these specific patterns. They showed exactly how to construct a function that has poles (tall spikes) at these specific locations with the exact heights required.

4. The Examples: Testing the Map

Finally, the authors tested their new map on specific, real-world examples (mathematical equations).

They looked at cases where the "denominator" of their rule was a special kind of polynomial.
They calculated the gaps, the generators, and the symmetry for these examples, proving their formulas work in practice.

Summary

In short, Zhang and Zhao took a complex, abstract mathematical structure (Linearized Function Fields) and:

Mapped the missing numbers (Gaps) at its most isolated points.
Found the building blocks (Generators) needed to reconstruct the allowed numbers.
Determined when the structure is perfectly symmetrical.
Extended this to groups of points, providing the smallest possible list of rules to describe them all together.
Provided the actual mathematical tools (functions) to build these structures.

They didn't just say "it's possible"; they handed you the blueprint and the bricks to build it yourself.

Technical Summary: Weierstrass Semigroups at Totally Ramified Places of Degree One on Linearized Function Fields

Problem Statement
The paper addresses the characterization of Weierstrass semigroups and their associated gap sets at totally ramified places of degree one within the context of linearized function fields. While the theory of Weierstrass semigroups at single and multiple rational places is well-established for specific curves (e.g., Hermitian, GK, and GGS curves), a unified description for the general class of linearized function fields defined by separable linearized polynomials has been lacking. Specifically, the authors aim to determine the set of gaps $G(Q)$ , the generators, the multiplicity, and the Frobenius number for a single totally ramified place $Q$ , and to extend this analysis to the minimal generating sets of semigroups at several such places.

Methodology
The authors work within the framework of algebraic function fields over an algebraic extension $K$ of a finite field $\mathbb{F}_q$ . The function field $F = K(x, y)$ is defined by the equation $L(y) = f(x)/g(x)$ , where $L(y)$ is a separable linearized polynomial and $f(x), g(x)$ are coprime polynomials.

The methodology relies on the following technical steps:

Dimension Calculation: The authors first establish a unified description of the Riemann-Roch space $L(D)$ for divisors $D$ supported on ramified places. By utilizing the basis $\{1, y, \dots, y^{p^n-1}\}$ of the extension $F/K(x)$ , they derive an explicit formula for the dimension $\ell(D)$ (Corollary 3.2). This extends previous results that were restricted to cases where $\deg f(x) > \deg g(x)$ .
Gap Characterization: Using the dimension formula, they characterize the set of gaps $G(Q)$ at a totally ramified place $Q$ of degree one. They provide a unified description of $G(Q)$ involving floor and ceiling functions dependent on the degrees of the polynomials in the defining equation.
Semigroup Construction: From the gap set, they explicitly construct the Weierstrass semigroup $H(Q)$ , identifying its system of generators, multiplicity, and Frobenius number.
Symmetry Analysis: They derive a necessary and sufficient condition for $H(Q)$ to be a symmetric semigroup.
Multi-Place Analysis: Extending the work of Matthews, Carvalho, and Torres, the authors investigate the minimal generating set $\tilde{\Gamma}(Q_1, \dots, Q_s)$ for $s$ distinct totally ramified places. They define the sets $\Gamma(Q_1, \dots, Q_t)$ and provide explicit descriptions of these sets, along with the construction of specific functions whose pole divisors correspond to the elements of these generating sets.

Key Contributions and Results

Unified Gap Description: The paper provides a unified formula for the gap set $G(Q)$ at a totally ramified place of degree one (Proposition 3.4), applicable regardless of the relative degrees of $f(x)$ and $g(x)$ .
Explicit Semigroup Parameters: For a totally ramified place $Q$ $Q$ , the authors explicitly provide:
- A system of generators for $H(Q)$ (Corollary 3.6).
- The multiplicity $m_{H(Q)}$ and the Frobenius number $F_{H(Q)}$ (Corollary 3.7).
Symmetry Condition: A necessary and sufficient condition for the symmetry of $H(Q)$ is established: $H(Q)$ is symmetric if and only if $n_k \equiv -1 \pmod{p^n}$ for all $k$ in the index set excluding the index of $Q$ (Theorem 3.8).
Minimal Generating Sets for Multiple Places: The paper fully determines the set $\Gamma(Q_1, \dots, Q_t)$ for $t$ distinct totally ramified places (Theorem 4.1). Crucially, the authors do not just describe the set abstractly; they explicitly construct functions $z$ such that the coefficients of their pole divisors lie exactly within the minimal generating set $\Gamma(Q_1, \dots, Q_t)$ .
Applications to Specific Cases: The results are applied to two specific cases based on the sign of $n_0$ $n_{0}$ (related to the degree of the denominator):
- Case $n_0 \leq 0$ : Explicit descriptions of $G(Q)$ , $H(Q)$ , and $\Gamma$ sets are provided (Proposition 5.1).
- Case $n_0 > 0$ : Similar explicit descriptions are given for the infinite place $Q_\infty$ and finite places (Propositions 5.3 and 5.5).
Examples: The paper includes concrete examples (Examples 5.2 and 5.6) over $\mathbb{F}_8$ to illustrate the calculation of gap sets, Frobenius numbers, and minimal generating sets for specific linearized function fields.

Significance
The paper claims significance by providing a comprehensive and unified framework for analyzing Weierstrass semigroups in linearized function fields, a class that includes important families such as Hermitian and norm-trace function fields as special cases. By removing the restriction on the degrees of the numerator and denominator polynomials, the results generalize previous findings (e.g., those by Navarro). The explicit construction of functions corresponding to the minimal generating sets offers practical tools for further research in algebraic geometry codes and the classification of maximal function fields. The work contributes to the broader understanding of the arithmetic properties of function fields, which are essential for identifying automorphism groups and constructing codes with good parameters.

1. The Goal: Mapping the "Gaps"

2. The Discovery: A Unified Map

3. The Team Effort: Multiple Locations

4. The Examples: Testing the Map

Summary

More like this