pith. sign in

arxiv: 1405.7582 · v2 · pith:RQJOGNOGnew · submitted 2014-05-29 · 🧮 math.RA · math.GR

Tame and wild refinement monoids

classification 🧮 math.RA math.GR
keywords monoidsrefinementtamewildcancellationenjoyimpliesproperties
0
0 comments X
read the original abstract

The class of refinement monoids (abelian monoids satisfying the Riesz refinement property) is subdivided into those which are tame, defined as being an inductive limit of finitely generated refinement monoids, and those which are wild, i.e., not tame. It is shown that tame refinement monoids enjoy many positive properties, including separative cancellation ($2x=2y=x+y \implies x=y$) and multiplicative cancellation with respect to the algebraic ordering ($mx\le my \implies x\le y$). In contrast, examples are constructed to exhibit refinement monoids which enjoy all the mentioned good properties but are nonetheless wild.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.