Symmetry and factorization of numerical sets and monoids (Q1348683)

A numerical monoid \(S\) is an additive submonoid of \(\mathbb{Z}_+\) whose complement \(\mathbb{Z}_+-S\) is finite. Numerical monoids have been studied extensively, often because of their connection with commutative ring theory. In this paper, the authors introduce and investigate a generalization of this concept, called a numerical set. Specifically, a numerical set is a subset \(S\) of \(\mathbb{Z}\) which is bounded below and whose complement \(\mathbb{Z}-S\) is bounded above. They study the structure of numerical sets, the interplay between numerical sets and numerical monoids, and concepts related to symmetry for numerical sets. They also define the direct sum of two numerical sets and show that a numerical monoid may be ``factored'' (not necessarily uniquely) as a direct sum of irreducible numerical monoids.