The Frobenius problem for Thabit numerical semigroups (Q2347033): Difference between revisions

Let \(\mathbb{N}\) denote the set of nonnegative integers. In this paper, the authors consider numerical semigroups generated by sets of Thabit numbers, which are integers of the form \(t_i=3\cdot2^i-1\) for \(i\in\mathbb{N}\). These integers have connections to amicable numbers, as can be seen in [\textit{S. Brentjes} and \textit{J. P. Hogendijk}, Hist. Math. 16, No. 4, 373--378 (1989; Zbl 0689.01001)]. They are also interesting in the context of numerical semigroups because they have a simple recursive formula (given by \(t_{i+1}=2t_i+1\)). For any \(n\in\mathbb{N}\), consider the set of Thabit numbers \(\{t_{n+i}: i\in\mathbb{N}\}\). This set of mutually relatively prime nonnegative integers generates the numerical semigroup \(T(n)\), which the authors call a Thabit numerical semigroup, the main object to investigate in this paper. The authors first show that \(\{t_{n+i}: 0\leq i\leq n+1\}\) is the minimal system of generators for \(T(n)\), so the embedding dimension of \(T(n)\) is \(n+2\). They determine the Apéry set of \(t_n\) in \(T(n)\), from which they can deduce the Frobenius number of \(T(n)\). They then use the Apéry set of \(t_n\) in \(T(n)\) to describe the pseudo-Frobenius numbers of \(T(n)\) along with its type, which is \(n+1\). Finally, they compute the gender (genus) of \(T(n)\).