On divisor-closed submonoids and minimal distances in finitely generated monoids (Q1733316)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On divisor-closed submonoids and minimal distances in finitely generated monoids |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On divisor-closed submonoids and minimal distances in finitely generated monoids |
scientific article |
Statements
On divisor-closed submonoids and minimal distances in finitely generated monoids (English)
0 references
21 March 2019
0 references
For a finitely generated commutative cancellative monoid \(H\), the authors study the set \(\Delta^*(H)\) of minimal distances occurring in the theory of non-unique factorizations, developed in the book by \textit{A. Geroldinger} and \textit{F. Halter-Koch} [Non-unique factorizations. Algebraic, combinatorial and analytic theory. Boca Raton, FL: Chapman \& Hall/CRC (2006; Zbl 1113.11002)]. They show that the divisor-closed submonoids \(A\) of \(H\) form a finite lattice (Theorem 4), determine the sets of generators for them, and show how to compute \(\Delta^*(A)\). In the case when \(H\) is an affine semigroup a geometric approach is used to describe its divisor-closed submonoids (Theorem 15). This is used to present an algorithm to compute \(\Delta^*(H)\) for every finitely generated \(H\).
0 references
divisor-closed submonoid
0 references
set of minimal distances
0 references
non-unique factorizations
0 references
commutative monoid
0 references
cancellative monoid
0 references
polyhedral cone
0 references
finitely generated monoid
0 references