Bounds for invariants of numerical semigroups and Wilf's conjecture (Q6156083): Difference between revisions

Let \(\mathbb{N}\) denote the set of non-negative integers. Let \(e\geq 2\) be a positive integer. Let \(2\leq g_1 < \dots < g_{e}\) be coprime positive integers. Let \[ S=\langle g_1, \dots, g_{e}\rangle =\{a_1g_1+\cdots+a_{e}g_{e} \mid a_i \in \mathbb{N}\} \] denote the numerical semigroup generated by \(g_1,\dots,g_e\). Let \(F=\max (\mathbb{N}\setminus S)\) be the Frobenius number of \(S\) and \(n=|S\cap[0,F]|\). Determining the integer \(F\) is the subject of the Diophantine Frobenius problem. The Wilf conjecture states that \(F+1\leq en\). In this paper, the authors prove that \(g_1\leq (e-1)n+1\). As a corollary, they obtain that if \(q=\left\lceil \frac{F+1}{g_1}\right\rceil\), then \(F+1\leq qen\leq en^2\). Furthermore, they give an alternative proof of the Wilf conjecture when the numerical semigroup \(S\) is almost-symmetric.