Presentations of a numerical semigroup

Part of the Developments in Mathematics book series (DEVM, volume 20)


Rédei in [53] 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.


Binary Relation Numerical Semigroup Minimal Relation Free Monoids Cancellative Monoids 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Department of Algebra, Faculty of SciencesUniversity of Granada, Campus University FuentenuevaGranadaSpain

Personalised recommendations