SATURATED NUMERICAL SEMIGROUPS

dc.contributor.authorBranco, Manuel B.
dc.date.accessioned2008-06-03T11:57:51Z
dc.date.available2008-06-03T11:57:51Z
dc.date.issued2004
dc.description.abstractWe characterize those subsets of N that are saturated numerical semigroups. We introduce the concept of SAT system of generators for a saturated numerical semigroup, and this will enable us to arrange the set of all saturated numerical semigroups in a binary tree with no leaves.en
dc.format.extent173437 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.accesstyperestrito_metadadosen
dc.identifier.authoremailmbb@uevora.pt
dc.identifier.numrev2en
dc.identifier.pagina321-330.en
dc.identifier.revistaHounston J. of Mathematicsen
dc.identifier.urihttp://hdl.handle.net/10174/1205
dc.identifier.volumerev30en
dc.language.isoeng
dc.rightsrestrictedAccessen
dc.subjectsaturated numericalen
dc.subjectsaturated numericalen
dc.titleSATURATED NUMERICAL SEMIGROUPSen
dc.typearticleen

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
saturated-numerical-semigroups.pdf
Size:
169.37 KB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
3.6 KB
Format:
Item-specific license agreed upon to submission
Description: