Primely generated refinement monoids
From MaRDI portal
Abstract: We extend both Dobbertin's characterization of primely generated regular refinement monoids and Pierce's characterization of primitive monoids to general primely generated refinement monoids.
Cites work
- Cancellation in primely generated refinement monoids.
- Embedding simple commutative monoids into simple refinement monoids
- Finitely generated antisymmetric graph monoids.
- Nonstable \(K\)-theory for graph algebras.
- Primely generated regular refinement monoids
- Semilattices of groups and inductive limits of Cuntz algebras
- Semilattices of groups and nonstable K-theory of extended Cuntz limits
- Separative cancellation for projective modules over exchange rings
- Shorter Notes: Redei's Finiteness Theorem for Commutative Semigroups
- THE REALIZATION PROBLEM FOR VON NEUMANN REGULAR RINGS
- Tame and wild refinement monoids
- The regular algebra of a poset
- The structure of countable Boolean algebras
Cited in
(6)- The realization problem for finitely generated refinement monoids
- Prime and semiprime acts over monoids with zero
- Tame and wild refinement monoids
- Refinement monoids and adaptable separated graphs
- Cancellation in primely generated refinement monoids.
- Representing finitely generated refinement monoids as graph monoids
This page was built for publication: Primely generated refinement monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312277)