The Number of Saturated Numerical Semigroups with a Determinate Genus

dc.contributor.author	Rosales, J.C.
dc.contributor.author	Branco, M.B.
dc.contributor.author	Torrão, D.
dc.contributor.editor	Jean-Pierre Bourguignon, Rolf Jelts, Alberto Adrego Pinto, Marcelo Viana
dc.date.accessioned	2016-03-07T18:19:11Z
dc.date.available	2016-03-07T18:19:11Z
dc.date.issued	2015
dc.description.abstract	In this work we describe the saturated numerical semigroups, and characterize the SAT system of generators for them. We see how we can arrange them in a tree rooted in NN and describe the sons of any vertex of this tree. Finally, we present an algorithm for computing the set of saturated numerical semigroups of a given genus	por
dc.identifier.authoremail	nd
dc.identifier.authoremail	nd
dc.identifier.authoremail	nd
dc.identifier.citation	Dynamics, Games and Science Volume 1 of the series CIM Series in Mathematical Sciences pp 607-616	por
dc.identifier.doi	10.1007/978-3-319-16118-1_33	por
dc.identifier.isbn	978-3-319-16117-4
dc.identifier.scientificarea	333	por
dc.identifier.uri	http://link.springer.com/chapter/10.1007%2F978-3-319-16118-1_33
dc.identifier.uri	http://hdl.handle.net/10174/17767
dc.language.iso	eng	por
dc.publisher	Springer	por
dc.rights	restrictedAccess	por
dc.subject	Saturated numerical semigroups, genus	por
dc.title	The Number of Saturated Numerical Semigroups with a Determinate Genus	por
dc.type	bookPart	por

Files

Now showing 1 - 1 of 1

Name:: Porto_the number of saturated numerical semigroups with a determine genus.pdf
Size:: 119.64 KB
Format:: Adobe Portable Document Format

Now showing 1 - 1 of 1