Author:
O’NEILL CHRISTOPHER,PELAYO ROBERTO
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.
Publisher
Cambridge University Press (CUP)
Reference12 articles.
1. [3] S. Colton and N. Kaplan , ‘The realization problem for delta sets of numerical semigroups’, Preprint, 2015, arXiv:1503.08496.
2. Minimal presentations for monoids with the ascending chain condition on principal ideals
3. [4] M. Delgado , P. García-Sánchez and J. Morais , ‘NumericalSgps, A package for numerical semigroups’, Version 1.1.0, 2017, GAP package, https://gap-packages.github.io/numericalsgps/.
4. The Catenary and Tame Degree in Finitely Generated Commutative Cancellative Monoids
5. [5] Y. Fan and A. Geroldinger , ‘Minimal relations and catenary degrees in Krull monoids’, Preprint, 2016, arXiv:1603.06356.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献