The doubles of one half of a numerical semigroup. (Q5964545)

A numerical semigroup \(S\) is an additive submonoid of the natural numbers with finite complement. The quotient of \(S\) by an integer \(d\geq 2\) is \(\frac{S}{d}=\{x\in\mathbb N\mid dx\in S\}\). Given \(S\), the authors study the set of numerical semigroups \(T\) such that \(\frac{S}{d}=\frac{T}{d}\), comparing them under the partial order given by inclusion. They show that for any \((S,d)\) this set has no minimal elements and has only finitely many maximal elements. The rest of the paper focuses on the case \(d=2\). In [\textit{A. M. Robles-Pérez} et al., J. Pure Appl. Algebra 213, No. 3, 387-396 (2009; Zbl 1166.20054)], the authors show that the set of numerical semigroups \(T\) with \(\frac{S}{2}=\frac{T}{2}\) is in bijection with pairs \((m,H)\) where \(m\in S\) is odd and \(H\) is a special kind of subset of the complement \(\mathbb N\setminus S\) called an \(m\)-upper subset. The authors of this paper adapt these ideas to describe the subset of these semigroups \(T\) which contain \(S\), and the subset which are contained in \(S\). They then consider the special case where \(S\) is generated by two elements and give formulas matching those \textit{F. Strazzanti} [Int. J. Algebra Comput. 25, No. 6, 1043-1053 (2015; Zbl 1344.20078)].