English

The Buchweitz set of a numerical semigroup

Combinatorics 2020-11-25 v2 Commutative Algebra Number Theory

Abstract

Let AZA \subset {\mathbb Z} be a finite subset. We denote by B(A)\mathcal{B}(A) the set of all integers n2n \ge 2 such that nA>(2n1)(A1)|nA| > (2n-1)(|A|-1), where nA=A++AnA=A+\cdots+A denotes the nn-fold sumset of AA. The motivation to consider B(A)\mathcal{B}(A) stems from Buchweitz's discovery in 1980 that if a numerical semigroup SNS \subseteq {\mathbb N} is a Weierstrass semigroup, then B(NS)=\mathcal{B}({\mathbb N} \setminus S) = \emptyset. By constructing instances where this condition fails, Buchweitz disproved a longstanding conjecture by Hurwitz (1893). In this paper, we prove that for any numerical semigroup SNS \subset {\mathbb N} of genus g2g \ge 2, the set B(NS)\mathcal{B}({\mathbb N} \setminus S) is finite, of unbounded cardinality as SS varies.

Keywords

Cite

@article{arxiv.2011.09187,
  title  = {The Buchweitz set of a numerical semigroup},
  author = {S. Eliahou and J. I. García-García and D. Marín-Aragón and A. Vigneron-Tenorio},
  journal= {arXiv preprint arXiv:2011.09187},
  year   = {2020}
}
R2 v1 2026-06-23T20:20:29.337Z