Key points are not available for this paper at this time.
We present two families of numerical semigroups and show that for each family, the number of required components in an irreducible decomposition cannot be bounded by any given integer. This gives a negative answer to a question raised by Delgado, Garc\'ia-S\'anchez and Rosales.
Bogart et al. (Fri,) studied this question.