intersection of irreducible complexity of Algorithm Intersection
We study two algorithms to decompose
a numerical semigroup S as intersection of irreducible
numerical semigroups. We also present a
compared study of two algorithms to compute the intersection
of two numerical semigroups with embedding
dimension two and the same multiplicity.