The catenary and tame degree of numerical monoids
- 1 January 2009
- journal article
- research article
- Published by Walter de Gruyter GmbH in Forum Mathematicum
- Vol. 21 (1) , 117-129
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.Keywords
This publication has 7 references indexed in Scilit:
- Full Elasticity in Atomic Monoids and Integral DomainsRocky Mountain Journal of Mathematics, 2006
- ON DELTA SETS OF NUMERICAL MONOIDSJournal of Algebra and Its Applications, 2006
- The Catenary and Tame Degree in Finitely Generated Commutative Cancellative Monoidsmanuscripta mathematica, 2006
- Computing the elasticity of a Krull monoidLinear Algebra and its Applications, 2001
- AN ALGORITHMIC METHOD TO COMPUTE A MINIMAL RELATION FOR ANY NUMERICAL SEMIGROUPInternational Journal of Algebra and Computation, 1996
- Minimal sets of generators for the relation ideals of certain monomial curvesmanuscripta mathematica, 1993
- Note on Linear FormsProceedings of the American Mathematical Society, 1956