On the enumeration of the set of saturated numerical semigroups of a given genus
In this paper we present an algorithm for computing the set of saturated numerical semigroups of a given genus. We see how the set of saturated numerical semigroups can be arranged in a tree rooted in N and we describe the sons of any vertex of this tree.
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | por |
| Publicado em: |
2014
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10174/10440 |
| País: | Portugal |
| Oai: | oai:dspace.uevora.pt:10174/10440 |