Weierstrass semigroups and the order bound

Abstract: The aim of this survey is to provide the reader with an essential and accessible introduction to the theory of Weierstrass semigroups, in the context of the theory developed by K.-O. Stöhr and J.F. Voloch. Furthermore, we discuss an application of Stöhr-Voloch theory in coding theory, namely the Feng-Rao bound (also known as the order bound) for the dual minimum distance of one-point algebraic geometry codes from a curve, which relies on the knowledge of certain Weierstrass semigroups of the curve.

• The paper demonstrates how Weierstrass semigroups provide a foundation for tighter order bound estimates in one-point AG codes.
• It leverages explicit computations and geometric insights from maximal curves, such as Hermitian curves, to improve classical coding bounds.
• The study bridges arithmetic geometry and coding theory, offering practical guidelines for optimizing error-correcting code performance.

Weierstrass Semigroups and the Order Bound: Survey and Applications

Overview and Motivation

The survey "Weierstrass semigroups and the order bound" (2605.01348) provides a technical account of the theory underlying Weierstrass semigroups for algebraic curves over finite fields, with a focused exposition on their relationship to the order bound in coding theory. Rooted in the geometric framework established by Stöhr and Voloch, the paper systematically reviews the crucial role that Weierstrass semigroups play both in arithmetic geometry and practical code construction, emphasizing the pivotal connection between intrinsic curve invariants and the design of optimal algebraic geometry (AG) codes.

Theory of Weierstrass Semigroups

The Weierstrass semigroup $H(P)$ at a point $P$ on a curve $X$ is the set of pole orders for rational functions regular away from $P$ whose only pole is at $P$. The gap set $G(P)$ comprises integers not realized as pole orders, whose cardinality equals the genus $g$ of the curve. The survey presents a thorough review of linear series, Hermitian invariants, and the geometric realization of semigroups, explicitly connecting the algebraic structure of $H(P)$ with the osculating and embedding geometry of $X$ in projective space.

Rigorous constructions cover both the classical case of $\mathbb{P}^1$ and higher-genus examples including maximal curves such as Hermitian, Giulietti-Korchmáros, Suzuki, and Skabelund curves. The explicit computation and classification of Weierstrass semigroups for these curves serve not only as geometric invariants, but also as critical input for determining automorphism groups and isomorphism classes of maximal curves.

Linear Series, Morphisms, and the Geometric Framework

The exposition clarifies the bijection between base-point-free linear series of fixed projective dimension and projective equivalence classes of non-degenerate morphisms $P$0. This correspondence enables the translation between divisor-theoretic data and projective embedding properties of curves, establishing hyperplane section series as central geometric objects. The technical machinery provides a template for explicit calculations of order sequences, gap sets, and semigroups, and their role in controlling the structure and uniqueness properties of maximal curves.

AG Codes and the Order Bound

The survey delivers a structured discussion of AG code construction, duality, and the Goppa bound for minimum distance. Importantly, it focuses on one-point AG codes, where the knowledge of the Weierstrass semigroup $P$1 at the parametrizing point $P$2 enables sharp improvements on minimum distance estimates. The Feng-Rao bound, or order bound, is presented as a direct consequence of Weierstrass theory, giving a strictly improved lower bound for the dual minimum distance of one-point AG codes:

$P$3

where $P$4 counts pairs $P$5 such that $P$6 for $P$7 in the semigroup.

In all instances considered, the order bound exceeds the classical Goppa bound, especially for codes arising from maximal curves with tightly controlled semigroups. Explicit examples, including Reed–Solomon and Hermitian codes, illustrate both classical and semigroup-based bounds and showcase the operational impact of semigroup invariants on code parameters.

Practical and Theoretical Implications

The implications of Weierstrass semigroup computations are twofold. Theoretically, the semigroup structure governs the geometric and arithmetic properties of curves and their embeddings. Practically, the semigroup dictates the attainable minimum distance and thus the error-correcting power of AG codes. The explicit determination of $P$8 for various curves informs not only optimal code design but also the classification and uniqueness questions for maximal and near-maximal curves.

The survey highlights several open problems:

• Classification of Weierstrass semigroups: The full characterization of which numerical semigroups appear as $P$9 at rational or non-rational points remains unsolved, especially for general maximal curves.
• Realizability and constraints: Criteria for realizing a given semigroup as the Weierstrass semigroup at a rational point of a curve over $X$0 are not fully established.
• Optimization for AG codes: Systematic identification of semigroups yielding optimal codes, including quantification of the impact of invariants such as symmetry or telescopicity.

Unexpected diversity in semigroup types among families of maximal curves demonstrates that further advances require deep algebraic and computational analysis.

Future Directions

The ongoing computation of Weierstrass semigroups for the Garcia-Güneri-Stichtenoth curves $X$1 for $X$2 is anticipated to shed new light on both curve classification and AG code optimization. As techniques for multi-point codes and generalized order bounds evolve, additional semigroup invariants may be leveraged for improved error-correcting performance and more refined geometric classification. The interplay between algebraic geometry, arithmetic invariants, and coding theory continues to drive the expansion of this interdisciplinary field.

Conclusion

This survey provides a comprehensive technical foundation for the study of Weierstrass semigroups and their applications to the order bound for AG codes. It thoroughly develops the geometric and arithmetic framework, documents major explicit computations and their impact, and identifies directions for future research. The integration of semigroup theory with coding practice is both deep and practical, offering a rigorous pathway to improved AG codes, new geometric insights, and broader advances in arithmetic geometry.