摘要

Several recent articles have studied the structure of the delta set of a numerical monoid. We continue this work with the assumption that the generating set S chosen for the numerical monoid M is not necessarily minimal. We show that for certain choices of S, the resulting delta set can be made (in terms of cardinality) arbitrarily large or small. We close with a close analysis of the case where M = < n(1), n(2), in(1) + jn(2)> for non-negative i and j.

  • 出版日期2010