On the enumeration of the set of saturated numerical semigroups with fixed Frobenius number
In this paper, we present an efficient algorithm to compute the set of saturated numerical semigroups with a given Frobenius number.
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2015
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10174/13099 |
| País: | Portugal |
| Oai: | oai:dspace.uevora.pt:10174/13099 |