On divisor-closed submonoids and minimal distances in finitely generated monoids

Identificadores
URI: http://hdl.handle.net/10498/35366
DOI: 10.1016/J.JSC.2018.06.008
ISSN: 0747-7171
Files
Statistics
Metrics and citations
Metadata
Show full item recordDate
2017Department
MatemáticasSource
Journal of Symbolic Computation, Vol. 93, 2019, pp. 230-245Abstract
We study the lattice of divisor-closed submonoids of finitely generated cancellative commutative monoids. In case the monoid is an affine semigroup, we give a geometrical characterization of such submonoids in terms of its cone. Finally, we use our results to give an algorithm for computing t,. Δ*(H), the set of minimal distances of H.
Subjects
Divisor-closed submonoid; Archimedean component; Set of minimal distances; Non-unique factorizations; Commutative monoid; Cancellative monoid; Polyhedral cone; Finitely generated monoidCollections
- Artículos Científicos [11595]
- Articulos Científicos Matemáticas [506]





