Papers › Near-misses in Wilf's conjecture
Near-misses in Wilf's conjecture
Shalom Eliahou, Jean Fromentin
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Let S ⊆ N be a numerical semigroup with multiplicity m, conductor c and minimal generating set P. Let L = S ∩ [0, c -- 1] and W(S) = |P||L| -- c. In 1978, Herbert Wilf asked whether W(S) ≥ 0 always holds, a question known as Wilf's conjecture and open since then. A related number W0(S), satisfying W0(S) ≤ W(S), has recently been introduced. We say that S is a near-miss in Wilf's conjecture if W0(S) < 0. Near-misses are very rare. Here we construct infinite families of them, with c = 4m and W0(S) arbitrarily small, and we show that the members of these families still satisfy Wilf's conjecture.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections