A graph-theoretic approach to Wilf's conjecture - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2019

A graph-theoretic approach to Wilf's conjecture


Let S ⊆ N be a numerical semigroup with multiplicity m = min(S \ {0}) and conductor c = max(N \ S) + 1. Let P be the set of primitive elements of S, and let L be the set of elements of S which are smaller than c. A longstand-ing open question by Wilf in 1978 asks whether the inequality |P||L| ≥ c always holds. Among many partial results, Wilf's conjecture has been shown to hold in case |P| ≥ m/2 by Sammartano in 2012. Using graph theory in an essential way, we extend the verification of Wilf's conjecture to the case |P| ≥ m/3. This case covers more than 99.999% of numerical semigroups of genus g ≤ 45.
Fichier principal
Vignette du fichier
wilf-and-graphs.pdf (228.89 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02280832 , version 1 (06-09-2019)



Shalom Eliahou. A graph-theoretic approach to Wilf's conjecture. 2019. ⟨hal-02280832⟩
48 View
70 Download



Gmail Mastodon Facebook X LinkedIn More