Symmetric Numerical Semigroups: Theory & Structure

• Symmetric numerical semigroups are finitely generated, cofinite additive submonoids of nonnegative integers that exhibit a unique duality between gaps and elements through invariants like the Frobenius number.
• Their structure informs the classification of Gorenstein one-dimensional local rings and supports explicit syzygy and Betti number analyses via palindromic semigroup polynomials and Apéry set symmetries.
• Generalizations such as p-symmetry and almost symmetry extend the classical theory, raising open questions on cyclotomic properties and efficient classification of Delta sets.

A symmetric numerical semigroup is a finitely generated, cofinite additive submonoid of the nonnegative integers exhibiting a strong combinatorial duality in its pattern of gaps and elements. This duality, captured both algebraically and via invariants such as the Frobenius number, genus, Apéry set, and the semigroup polynomial, has far-reaching consequences for the structure theory of numerical semigroups and their associated rings. Symmetric numerical semigroups underlie the theory of Gorenstein one-dimensional local rings and play a central role in the classification of gaps, pseudo-Frobenius numbers, and arithmetical invariants such as Delta sets. The theory encompasses detailed structural theorems, explicit classification in low embedding dimensions, homological and combinatorial invariants, and a range of generalizations, including $p$-symmetric and almost symmetric semigroups.

1. Foundational Definitions and Criteria

A numerical semigroup $S\subset\mathbb{N}_0$ is defined by three axioms: $0\in S$, $S$ is closed under addition, and $\mathbb{N}_0\setminus S$ is finite. Every $S$ has a unique minimal generating set $\{n_1,\dots,n_e\}$; the cardinality $e$ is the embedding dimension. The Frobenius number $F(S)=\max(\mathbb{N}_0\setminus S)$ and the conductor $c(S)=F(S)+1$ satisfy that every $m\geq c(S)$ belongs to $S$.

$S$ is symmetric if for every $m\in\mathbb{Z}$, exactly one of $m$ or $F(S)-m$ lies in $S$; equivalently, for any $x\in\mathbb{Z}\setminus S$, $F(S)-x\in S$. The genus $g(S)=|\mathbb{N}_0\setminus S|$ satisfies $F(S)+1=2g(S)$ if and only if $S$ is symmetric. The type $t(S)$, the number of pseudo-Frobenius numbers, equals $1$ precisely for symmetric semigroups, i.e., $\operatorname{PF}(S)=\{F(S)\}$.

Symmetry admits alternative characterizations:

• The Apéry set with respect to a minimal generator $m$ is $\operatorname{Ap}(S,m)=\{w\in S: w-m\notin S\}$, and $S$ is symmetric if and only if $w_i + w_{m-1-i} = F(S)+m$ for all $0\leq i\leq m-1$.
• The polynomial $P_S(x) = (1-x)\sum_{s\in S}x^s$ is palindromic with $P_S(x) = x^{F(S)+1} P_S(x^{-1})$ if and only if $S$ is symmetric.
• The semigroup algebra $k[[S]]$ (over a field $k$) is Gorenstein if and only if $S$ is symmetric (Süer et al., 2020).

2. Structural Properties and Invariants

The algebraic and homological structure of $S$ is reflected in:

• Betti Numbers: If $S$ is symmetric, the graded Betti numbers of $k[S]$ satisfy duality relations, with the maximal syzygy degree $g$ satisfying $F(S) = g - \sum n_i$ (Fel, 2016, Fel, 2018).
• Syzygy-Degree Identities: For symmetric semigroups not being complete intersections, specific polynomial and combinatorial identities restrict the Betti numbers and yield explicit lower bounds on $F(S)$, depending on embedding dimension and Watanabe-type constructions (Fel, 2016, Fel, 2018).
• Young Diagram Representation: $S$ can be associated with a Young diagram (Ferrers diagram), in which the symmetry of $S$ is reflected by combinatorial symmetries, and unique decompositions (e.g., end-to-end or overlap sum with the dual) correspond to structural operations on semigroups. These structural decompositions produce Gorenstein subrings in the semigroup algebra (Süer et al., 2020).

Homological and combinatorial invariants, such as the Apéry set, Delta set, and syzygy degrees, are tightly constrained by symmetry. For instance, in embedding dimension 3, symmetric semigroups admit a complete characterization of Delta sets via the Euclidean chain for a pair of integers associated with relations in the minimal presentation (García-Sánchez et al., 2017).

3. Construction Methods, Families, and Examples

Symmetric numerical semigroups form several rich infinite families:

• Telescopic Generators: Every telescopic numerical semigroup is symmetric, and in embedding dimension 3, all symmetric semigroups are telescopic (Micale et al., 2011).
• $S_{n,t}$ Construction: For each embedding dimension $e\ge4$, infinite families $S_{n,t}$ as defined by Sawhney and Stoner (Sawhney et al., 2017) provide symmetric but non-cyclotomic semigroups, confirming the Ciolan–García–Moree conjecture. The construction involves three blocks of minimal generators with explicit symmetry and palindromicity of the associated polynomials.
• Generalized Almost Arithmetic (AAG) Semigroups: Explicit structural and Frobenius-number results describe all symmetric cases among AAG-semgroups, determined by parametric families and corresponding Apéry set symmetries (Morales et al., 12 Jan 2026).

The cyclotomic property—where the semigroup polynomial factors into cyclotomic polynomials—interacts intricately with symmetry. All cyclotomic semigroups are symmetric, but not conversely; infinite families of symmetric but non-cyclotomic semigroups exist for every $e\geq4$ (Sawhney et al., 2017).

4. Homological and Combinatorial Aspects

The symmetric property imposes constraints on the minimal relations (syzygies) in $k[S]$:

• In the non-CI case, explicit polynomial identities relate the degrees of syzygies and yield precise lower bounds on the maximal syzygy degree and hence $F(S)$ (Fel, 2016, Fel, 2018). Watanabe's lemma allows for the construction of higher-dimensional symmetric semigroups from lower ones, sharpening these bounds inductively.
• The Delta set $\Delta(S)$, governing the possible gaps in lengths of factorizations, is explicitly determined in embedding dimension three via a Euclidean chain on invariants derived from the minimal presentation (García-Sánchez et al., 2017).
• For symmetric semigroups, the Apéry set symmetry yields succinct arithmetical and combinatorial consequences and forms the basis for decision algorithms in generalized settings (Morales et al., 12 Jan 2026).

Kunz's criterion formalizes the equivalence of symmetry with the Gorenstein property of $k[[S]]$ (Süer et al., 2020).

5. Generalizations: $p$-Symmetry and Almost Symmetry

Recent work extends the notion of symmetry:

• $p$-Symmetric Numerical Semigroups: The $p$-numerical semigroup $S_p$ associated to a generating set and integer $p$ retains a form of symmetry: $S_p$ is $p$-symmetric if, for all $x\notin S_p$, $\ell_0(p) + g_p - x \in S_p$, where $g_p$ is the $p$-Frobenius number and $\ell_0(p)$ is the least element of $S_p$. The characterization generalizes all classical symmetry results to the $p>0$ case (Komatsu, 2024).
• $p$-Almost Symmetric and $p$-Arf Property: Not every $p$-almost symmetric semigroup is $p$-symmetric. The $p$-Arf property is stable under dilation for two generators, but in larger embedding dimension, more delicate control of the Apéry set is needed (Komatsu, 2024).

In each case, generalized Watanabe and Johnson formulas preserve $p$-symmetry under certain linear constructions, and roots of related Diophantine equations yield Frobenius numbers in explicit families (Morales et al., 12 Jan 2026, Komatsu, 2024).

6. Open Problems and Contemporary Perspectives

Several questions remain unresolved:

• The equivalence between the cyclotomic property and the complete intersection property is open; no counterexample is known where a non-CI symmetric semigroup is cyclotomic (Sawhney et al., 2017).
• Classification of realizable Delta sets in higher embedding dimensions, as well as effective, fast algorithms for invariants beyond $e=3$, are active areas of inquiry (García-Sánchez et al., 2017).
• Decision and classification algorithms for generalized symmetric families, including the parameterized AAG semigroups, are now explicit and polynomial-time but may admit further optimization (Morales et al., 12 Jan 2026).

The study of symmetric numerical semigroups interfaces algebraic, combinatorial, and analytic number theory, with direct applications to ring theory, factorization invariants, and computational arithmetics. The extension to $p$-symmetric and almost symmetric families reflects a trend toward finer combinatorial and arithmetical distinctions. These advances continue to refine the interplay between combinatorics of semigroups and the algebraic theory of monomial curves and Gorenstein rings.