English

On parametrized families of numerical semigroups

Commutative Algebra 2020-05-20 v3 Combinatorics

Abstract

A numerical semigroup is an additive subsemigroup of the non-negative integers. In this paper, we consider parametrized families of numerical semigroups of the form Pn=f1(n),,fk(n)P_n = \langle f_1(n), \ldots, f_k(n) \rangle for polynomial functions fif_i. We conjecture that for large nn, the Betti numbers, Frobenius number, genus, and type of PnP_n each coincide with a quasipolynomial. This conjecture has already been proven in general for Frobenius numbers, and for the remaining quantities in the special case when Pn=n,n+r2,,n+rkP_n = \langle n, n + r_2, \ldots, n + r_k \rangle. Our main result is to prove our conjecture in the case where each fif_i is linear. In the process, we develop the notion of weighted factorization length, and generalize several known results for standard factorization lengths and delta sets to this weighted setting.

Keywords

Cite

@article{arxiv.1909.04281,
  title  = {On parametrized families of numerical semigroups},
  author = {Franklin Kerstetter and Christopher O'Neill},
  journal= {arXiv preprint arXiv:1909.04281},
  year   = {2020}
}