On the set of elasticities in numerical monoids
arXiv:1409.3425 · doi:10.1007/s00233-015-9740-2
Abstract
In an atomic, cancellative, commutative monoid , the elasticity of an element provides a coarse measure of its non-unique factorizations by comparing the largest and smallest values in its set of factorization lengths (called its length set). In this paper, we show that the set of length sets for any arithmetical numerical monoid can be completely recovered from its set of elasticities ; therefore, is as strong a factorization invariant as in this setting. For general numerical monoids, we describe the set of elasticities as a specific collection of monotone increasing sequences with a common limit point of .
References in corpus (1)
Cited by in corpus (9)
- Sparse solutions of linear Diophantine equations
- Sets of Arithmetical Invariants in Transfer Krull Monoids
- On factorization invariants and Hilbert functions
- On elasticities of locally finitely generated monoids
- Minimal presentations of shifted numerical monoids
- On the system of sets of lengths and the elasticity of submonoids of a finite-rank free commutative monoid
- Apéry sets of shifted numerical monoids
- Longest and Shortest Factorizations in Embedding Dimension Three
- Nearly Gorenstein and almost symmetric properties in shifted numerical semigroups