Article
Licensed
Unlicensed
Requires Authentication
The catenary and tame degree of numerical monoids
-
S. T. Chapman
Published/Copyright:
January 30, 2009
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
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Central extensions of rank 2 groups and applications
- Generating abelian groups by addition only
- Intrinsic ultracontractivity for non-symmetric Lévy processes
- K-Theory of non-linear projective toric varieties
- Wakamatsu tilting modules with finite FP-injective dimension
- The catenary and tame degree of numerical monoids
- On extending Prüfer rings in central simple algebras
- Geometry of the cone of positive quadratic forms
Articles in the same Issue
- Central extensions of rank 2 groups and applications
- Generating abelian groups by addition only
- Intrinsic ultracontractivity for non-symmetric Lévy processes
- K-Theory of non-linear projective toric varieties
- Wakamatsu tilting modules with finite FP-injective dimension
- The catenary and tame degree of numerical monoids
- On extending Prüfer rings in central simple algebras
- Geometry of the cone of positive quadratic forms
