On morphisms of commutative monoids
Identificadores
URI: http://hdl.handle.net/10498/35537
DOI: 10.1007/S00233-011-9349-Z
ISSN: 0037-1912
Files
Statistics
Metrics and citations
Metadata
Show full item recordDate
2012Department
MatemáticasSource
Semigroup Forum, Vol. 84, Núm. 2, 2012, pp. 333-341Abstract
The aim of this work is to study monoid morphisms between commutative
monoids. Algorithms to check if a monoid morphism between two finitely generated
monoids is injective and/or surjective are given. The structure of the set of monoid
morphisms between a monoid and a cancellative monoid is also studied and an algorithm
to obtain a system of generators of this set is provided.
Subjects
Finitely generated monoid; algorithm; monoid morphismCollections
- Artículos Científicos [11595]
- Articulos Científicos Matemáticas [506]





