On the enumeration of the set of saturated numerical semigroups of a given genus. (Q741652)

Let \(S\) be a numerical semigroup, that is, a submonoid of the set of nonnegative integers under addition and such that only finitely many nonnegative integers are not in \(S\) (the gaps of \(S\)). The number of nonnegative integers not belonging to \(S\) is known as the genus of \(S\). For \(s\in S\), define \(d_S(s)=\gcd\{t\in S\mid t\leq s\}\). The semigroup \(S\) is saturated if \(s+d_S(s)\in S\) for all \(s\in S\) (there are other equivalent definitions in the literature). It is well known that if we denote by \(\mathrm F(S)\) the Frobenius number of \(S\) (the largest integer not in \(S\)), and \(S\) is a saturated numerical semigroup other than \(\mathbb N\), then so is \(S\cup\{\mathrm F(S)\}\). Also the intersection of two saturated numerical semigroups is again saturated. Thus the set of all saturated numerical semigroups is a Frobenius variety. We can talk then of saturated systems of generators, that is, \(A\subseteq S\) such that the intersection of all saturated numerical semigroups containing \(A\) is \(S\). Naturally, the concept of minimal saturated systems of generators arises (they are unique, as are minimal generating systems in the monoid sense). Actually an element \(s\) is in a minimal saturated system of generators of a saturated numerical semigroup \(S\) if and only if \(S\setminus\{s\}\) is a saturated numerical semigroup. In order to construct the tree containing all saturated numerical semigroups, one starts with \(\mathbb N\), and then at each level (semigroups with a given genus), from every semigroup, we remove those saturated minimal generators greater than the Frobenius number of the semigroup, producing in this way descendants with one more gap. It is also known that either one or two elements in the minimal saturated systems of generators of a saturated semigroup \(S\) are larger than its Frobenius number. So every saturated numerical semigroup will have at most one or two sons. This paper studies these two cases: when there is exactly one generator larger than the Frobenius number or there are two; explaining in each case what is the minimal saturated system of generators of \(S\setminus\{s\}\) with \(s>\mathrm F(S)\) a minimal saturated generator. This enables the authors to present a fast algorithm to compute all saturated numerical semigroups with fixed genus.