Counting edges in factorization graphs of numerical semigroup elements

A numerical semigroup $S$ is an additive subsemigroup of the non-negative integers with finite complement, and the squarefree divisor complex of an element $m \in S$ is a simplicial complex $\Delta_m$ that arises in the study of multigraded Betti numbers. We compute squarefree divisor complexes for certain classes numerical semigroups, and exhibit a new family of simplicial complexes that are occur as the squarefree divisor complex of some numerical semigroup element.

On factorization invariants and Hilbert functions

For numerical semigroups with three generators, we study the asymptotic behavior of weighted factorization lengths, that is, linear functionals of the coefficients in the factorizations of semigroup elements. This work generalizes many previous results, provides more natural and intuitive proofs, and yields a completely explicit error bound.