Two algorithms for decomposition of a numerical semigroup as an intersection of irreducibles
Every numerical semigroup S admits a decomposition S = S1 \· · ·\Sn with Si irreducible (that is, Si is symmetric or pseudo-symmetric) for all i. We compare two different algorithms to obtain a numerical semigroup as intersection of irreducibles numerical semigroups.
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2012
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10174/6091 |
| País: | Portugal |
| Oai: | oai:dspace.uevora.pt:10174/6091 |