Fundamental gaps in numerical semigroups.

A set of nonnegative integers \(S\) is a numerical semigroup if \(S\) is closed under addition, \(0\in S\) and \(\gcd(S)=1\). If \(S\) is a numerical semigroup, then the set of gaps \(\text{H}(S)=\mathbb{N}\setminus S\) is finite and its maximum \(g(S)\) is the Frobenius number of \(S\); \(x\in\text{H}(S)\) is called a fundamental gap if \(kx\in S\) for all \(k\geq 2\); \(\text{FH}(S)\) is the set of all fundamental gaps of \(S\). A subset \(X\subseteq\mathbb{N}\) H-determines a numerical semigroup \(S\) if \(S\) is the maximal numerical semigroup such that \(X\subseteq\text{H}(S)\). It is shown that \(\text{FH}(S)\) is the smallest set which H-determines \(S\) and the Frobenius number \(g(S)\) determines \(S\) iff \(g(S)\in\{-1,1,2,3,4,6\}\). Lower and upper bounds for the number of fundamental gaps in terms of the Frobenius number are found and a method to construct all numerical semigroups containing a given one is described; the method is used to find the number of numerical semigroups \(S\) with given Frobenius number \(g(S)\leq 39\).

Recommendations

Cites work

Cited in

(40)

Describes a project that uses

Uses Software

NumericalSemigroupsWithGenus

This page was built for publication: Fundamental gaps in numerical semigroups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1434780)