Note on a theorem of Eliahou (Q2413510): Difference between revisions

In the paper under review, the Wilf conjecture is proven for a new class of monoids. Recall that a numerical monoid is a submonoid \(S\) of the additive monoid of natural numbers \(\mathbb{N}\), such that \(\mathbb{N}\setminus S\) finite. It is well-known that in this case, \(S\) is finitely generated. Denote by \(g_1<\cdots <g_e\) a set of generators with minimal \(e\). Then \(\gcd(g_1,\cdots,g_e)=1\). Denote by \(c\) the conductor of \(S\), which, by definition, is the minimal natural number, such that \(\{c,c+1,\cdots \}\subset S\). Write \(L(S)=S\cap \{0,\cdots ,c-1\}\) for the part of \(S\), which is ``on the left of \(c\)''. TheWilf conjecture (which is widely open) claims that \[\frac{|L(S)|}{c}\geq \frac{1}{e}.\] Among other results obtained in this paper, the authors prove that the Wilf conjecture holds if \(g_1\) divides \(c\) and \((n_0-1)g_e<ng_0-1\). The proof is based on a theorem of \textit{S. Eliahou}, on the Hilbert function on graded algebras [J. Eur. Math. Soc. (JEMS) 20, No. 9, 2105--2129 (2018; Zbl 1436.20114)] and uses a careful analysis of the surjective homomorphism \(\mathbb{N}^e\to S\), determined by a chosen system of generators.