Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 98 tok/s
Gemini 2.5 Pro 58 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 112 tok/s Pro
Kimi K2 165 tok/s Pro
GPT OSS 120B 460 tok/s Pro
Claude Sonnet 4 29 tok/s Pro
2000 character limit reached

Near-misses in Wilf's conjecture (1710.03623v1)

Published 10 Oct 2017 in math.CO

Abstract: Let S $\subseteq$ N be a numerical semigroup with multiplicity m, conductor c and minimal generating set P. Let L = S $\cap$ [0, c -- 1] and W(S) = |P||L| -- c. In 1978, Herbert Wilf asked whether W(S) $\ge$ 0 always holds, a question known as Wilf's conjecture and open since then. A related number W0(S), satisfying W0(S) $\le$ 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.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.