paper

On numerical semigroup elements and the - and -norms of their factorizations

arXiv:2503.12241

Abstract

A numerical semigroup is a cofinite, additively-closed subset of that contains 0, and a factorization of is a -tuple where expresses as a sum of generators of . Much~of the study of non-unique factorization centers on factorization length , which coincies with the -norm of as the -tuple. In this paper, we study the -norm and -norm of factorizations, viewed as alternative notions of length, with particular focus on the generalizations and of the delta set from classical factorization length. We prove that the -delta set is eventually periodic as a function of , classify and the 0-delta set for several well-studied families of numerical semigroups, and identify families of numerical semigroups demonstrating and can be arbitrarily long intervals and can avoid arbitrarily long subintervals.