Numerical semigroups with concentration two

Abstract

We define the concentration of a numerical semigroup S as C(S) = max {nextS (s) − s | s ∈ S\{0}} wherein nextS (s) = min {x ∈ S | s < x}. In this paper, we study the class of numerical semigroups with concentration 2. We give algorithms to calculate the whole set of this class of semigroups with given multiplicity, genus or Frobenius number. Separately, we prove that this class of semigroups verifies the Wilf’s conjecture.