Counting numerical semigroups by Frobenius number, multiplicity, and depth
Abstract
In 1990, Backelin showed that the number of numerical semigroups with Frobenius number f approaches Ci · 2f/2 for constants C0 and C1 depending on the parity of f. In this paper, we generalize this result to semigroups of arbitrary depth by showing there are (q+1)2/4f/(2q-2)+o(f) semigroups with Frobenius number f and depth q. More generally, for fixed q ≥ 3, we show that, given (q-1)m < f < qm, the number of numerical semigroups with Frobenius number f and multiplicity m is\[( (q+2)24 α/2 (q+1)24 (1-α)/2)m + o(m)\] where α = f/m - (q-1). Among other things, these results imply Backelin's result, strengthen bounds on Ci, characterize the limiting distribution of multiplicity and genus with respect to Frobenius number, and resolve a recent conjecture of Singhal on the number of semigroups with fixed Frobenius number and maximal embedding dimension.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.