The frobenius problem for generalized repunit numerical semigroups

Abstract

In this paper, we introduce and study the numerical semigroups generated by {a1, a2, . . .} ⊂ N such that a1 is the repunit number in base b > 1 of length n > 1 and ai − ai−1 = a bi−2, for every i ≥ 2, where a is a positive integer relatively prime with a1. These numerical semigroups generalize the repunit numerical semigroups among many others. We show that they have interesting properties such as being homogeneous and Wilf. Moreover, we solve the Frobenius problem for this family, by giving a closed formula for the Frobenius number in terms of a, b and n, and compute other usual invariants such as the Ap´ery sets, the genus or the type.