Cancellation in primely generated refinement monoids.
A commutative monoid \(M\) is a refinement groupoid if the equation \(a_1+a_2=b_1+b_2\) implies the existence of \(c_{11},c_{12},c_{21},c_{22}\in M\) such that \(a_1=c_{11}+c_{12}\), \(a_2=c_{21}+c_{22}\), \(b_1=c_{11}+c_{21}\), \(b_2=c_{12}+c_{22}\). Further, \(M\) is: cancellative if \(a+c=b+c\) implies \(a=b\), separative if \(2a=a+b=2b\) implies \(a=b\) and strongly separative if \(2a=a+b\) implies \(a=b\). It is proved that any primely generated refinement monoid \(M\) has separative cancellation, and even strong separative cancellation provided \(M\) has no nonzero idempotents. In addition, \(M\) is a semilattice with respect to the order \(\leq\) defined by \(a\leq b\) iff \(a+c=b\) for some \(c\in M\). It is shown that any finitely generated refinement monoid is primely generated (i.e. every element is a sum of prime elements of \(M\)). A number of questions answered in the paper arises in module theory and they are reformulated and generalized for refinement groupoids.
- Primely generated refinement monoids
- Primely generated regular refinement monoids
- Cancellation properties in ideal systems of monoids.
- Primary ideals of finitely generated commutative cancellative monoids
- A cancellativity criterion for presented monoids
- Cancellable elements of the lattice of monoid varieties
- Prime Ideals of Cancellative Semigroups
- Presentations of cancellative monoids
- ON SEPARATIVE REFINEMENT MONOIDS
- Cancellative conjugation semigroups and monoids
- Convex polytopes and factorization properties in generalized power series domains
- Embedding simple commutative monoids into simple refinement monoids
- Decomposition of strongly separative monoids
- When graded domains are Schreier or pre-Schreier
- The realization problem for finitely generated refinement monoids
- Nonstable \(K\)-theory for graph algebras.
- Primely generated refinement monoids
- The regular algebra of a poset
- ON SEPARATIVE REFINEMENT MONOIDS
- Extension of refinement rings
- Representing finitely generated refinement monoids as graph monoids
- Leavitt path algebras: the first decade.
- Refinement monoids and adaptable separated graphs
- Primely generated regular refinement monoids
- Tame and wild refinement monoids
- Finitely generated antisymmetric graph monoids.
This page was built for publication: Cancellation in primely generated refinement monoids.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1771879)
