Showing a limited preview of this publication:
Abstract
We construct an algorithm which computes the catenary and tame degree of a numerical monoid. As an example we explicitly calculate the catenary and tame degree of numerical monoids generated by arithmetical sequences in terms of their first element, the number of elements in the sequence and the difference between two consecutive elements of the sequence.
Received: 2007-02-11
Revised: 2007-06-21
Published Online: 2009-01-30
Published in Print: 2009-January
© de Gruyter 2009
