Counting edges in factorization graphs of numerical semigroup elements

Mariah Moschetti, Christopher O'Neill

A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$.…