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.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Language: | eng |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10174/6091 |
| Country: | Portugal |
| Oai: | oai:dspace.uevora.pt:10174/6091 |