Wilf's conjecture and Macaulay's theorem

Abstract

Let S ⊂eq N be a numerical semigroup with multiplicity m = min(S \ 0), conductor c = max(N \ S) + 1 and minimally generated by e elements. Let L be the set of elements of S which are smaller than c. Wilf conjectured in 1978 that |L| is bounded below by c/e. We show here that if c 3m, then S satisfies Wilf's conjecture. Combined with a recent result of Zhai, this implies that the conjecture is asymptotically true as the genus g(S) = |N \ S| goes to infinity. One main tool in this paper is a classical theorem of Macaulay on the growth of Hilbert functions of standard graded algebras.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…