Presentations of a numerical semigroup
Rédei in  shows that every congruence on ℕn is finitely generated. This result has since been known as Rédei’s theorem, and it is equivalent to the fact that every finitely generated (commutative) monoid is finitely presented. Rédei’s proof is long and elaborated. Many other authors have given alternative and much simpler proofs than his (see for instance [31, 39, 41, 56]). Since numerical semigroups are cancellative monoids, a different approach can be chosen to prove Rédei’s theorem. And this is precisely the path we choose in this chapter.
KeywordsBinary Relation Numerical Semigroup Minimal Relation Free Monoids Cancellative Monoids
Unable to display preview. Download preview PDF.