The Frobenius problem for numerical semigroups with multiplicity four. (Q2428561): Difference between revisions

A numerical semigroup is a subset \(S\) of positive integers closed under addition and containing all sufficiently large integers. The least element of \(S\), \(m(S)\), is called the multiplicity of \(S\) and the greatest element of \(\mathbb N\setminus S\) is called the Frobenius number of \(S\) and denoted by \(F(S)\). The authors consider the set \(\mathcal F\) of such semigroups with \(m(S)=4\) and three pairwise relatively prime minimal generators. They show that for every \(g\geq 4\), \(g\neq 9\), there exists \(S\in\mathcal F\) with \(g\notin S\), and give an explicit description of the set \(\{F(S):S\in\mathcal F\}\).