REALISABLE SETS OF CATENARY DEGREES OF NUMERICAL MONOIDS
Open Access
- 4 December 2017
- journal article
- research article
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 97 (2) , 240-245
Abstract
The catenary degree is an invariant that measures the distance between factorisations of elements within an atomic monoid. In this paper, we classify which finite subsets of $\mathbb{Z}_{\geq 0}$ occur as the set of catenary degrees of a numerical monoid (that is, a co-finite, additive submonoid of $\mathbb{Z}_{\geq 0}$ ). In particular, we show that, with one exception, every finite subset of $\mathbb{Z}_{\geq 0}$ that can possibly occur as the set of catenary degrees of some atomic monoid is actually achieved by a numerical monoid.
Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- A realization theorem for sets of distancesJournal of Algebra, 2017
- The realization problem for delta sets of numerical semigroupsJournal of Commutative Algebra, 2017
- Delta sets for symmetric numerical semigroups with embedding dimension threeAequationes mathematicae, 2017
- On the set of catenary degrees of finitely generated cancellative commutative monoidsInternational Journal of Algebra and Computation, 2016
- numericalsgps, a GAP package for numerical semigroupsACM Communications in Computer Algebra, 2016
- FACTORIZATION INVARIANTS IN HALF-FACTORIAL AFFINE SEMIGROUPSInternational Journal of Algebra and Computation, 2013
- Minimal presentations for monoids with the ascending chain condition on principal idealsSemigroup Forum, 2011
- Numerical Semigroups2009
- The Catenary and Tame Degree in Finitely Generated Commutative Cancellative Monoidsmanuscripta mathematica, 2006
- Non-Unique Factorizations2006