Numerical semigroups are combinatorial objects that lead to deep and subtle questions.  With tools from complex, harmonic, and functional analysis, probability theory, algebraic combinatorics, and computer-aided design, we answer virtually all asymptotic questions about factorization lengths in numerical semigroups.  Our results yield uncannily accurate predictions, along with unexpected results about symmetric functions, trace polynomials, and the statistical properties of certain AF C$^*$-algebras. 

Partially supported by NSF Grants DMS-1800123 and DMS-2054002.  Joint work (in various combinations) with K.~Aguilar, A.~B\"ottcher, \'A. Ch\'avez, L.~Fukshansky, M.~Omar, C.~O'Neill, J.~Vol\v{c}i\v{c} and undergraduate students J.~Hurley, G.~Udell, T.~Wesley, S.~Yih.