English

Counting numerical semigroups by Frobenius number, multiplicity, and depth

Combinatorics 2023-12-27 v2

Abstract

In 1990, Backelin showed that the number of numerical semigroups with Frobenius number ff approaches Ci2f/2C_i \cdot 2^{f/2} for constants C0C_0 and C1C_1 depending on the parity of ff. In this paper, we generalize this result to semigroups of arbitrary depth by showing there are (q+1)2/4f/(2q2)+o(f)\lfloor{(q+1)^2/4}\rfloor^{f/(2q-2)+o(f)} semigroups with Frobenius number ff and depth qq. More generally, for fixed q3q \geq 3, we show that, given (q1)m<f<qm(q-1)m < f < qm, the number of numerical semigroups with Frobenius number ff and multiplicity mm is((q+2)24α/2(q+1)24(1α)/2)m+o(m)\left(\left\lfloor \frac{(q+2)^2}{4} \right\rfloor^{\alpha/2} \left \lfloor \frac{(q+1)^2}{4} \right\rfloor^{(1-\alpha)/2}\right)^{m + o(m)} where α=f/m(q1)\alpha = f/m - (q-1). Among other things, these results imply Backelin's result, strengthen bounds on CiC_i, 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.

Keywords

Cite

@article{arxiv.2208.14587,
  title  = {Counting numerical semigroups by Frobenius number, multiplicity, and depth},
  author = {Sean Li},
  journal= {arXiv preprint arXiv:2208.14587},
  year   = {2023}
}

Comments

23 pages, 6 figures; accepted to Comb. Theory, incorporated referee comments

R2 v1 2026-06-28T00:27:01.752Z