A deterministic algorithm to decide if a finitely presented abelian monoid is cancellative (Q4370002)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1104128
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A deterministic algorithm to decide if a finitely presented abelian monoid is cancellative |
scientific article; zbMATH DE number 1104128 |
Statements
A deterministic algorithm to decide if a finitely presented abelian monoid is cancellative (English)
0 references
3 May 2000
0 references
commutative semigroups
0 references
finitely generated commutative monoids
0 references
finitely presented commutative monoids
0 references
cancellative monoids
0 references
algorithms
0 references
finite presentations
0 references
0 references
0.8113740682601929
0 references
0.7997762560844421
0 references
0.7948108315467834
0 references
0.792381227016449
0 references
\textit{L. Rédei} [The theory of finitely generated commutative semigroups. Pergamon (1965; see the review of the German ed. in Zbl 0126.04205)] proved that every finitely generated commutative monoid is finitely presented. In the paper under review the author gives an algorithm to compute a finite presentation for any finitely generated commutative cancellative monoid, and in particular he applies it to derive an algorithm to decide whether a finitely presented commutative monoid is cancellative or not.
0 references
