2000 character limit reached
Note on a question of Wilf (2106.07246v2)
Published 14 Jun 2021 in math.NT
Abstract: Let $S$ be a numerical semigroup with Frobenius number $f$, genus $g$ and embedding dimension $e$. % In 1978 Wilf asked the question, whether $\frac{f+1-g}{f+1}\geq\frac1e$. As is well known, this holds in the cases $e=2$ and $e=3$. For $e\geq4$, we derive from results of Zhai [5] the following (substantially weaker) lower bound [\frac{f+1-g}{f+1}>\left(\frac{2N+1}{(2N+2)(e-2)}\right)e\text{ with }\lfloor N\rfloor=104978\,.] To the best of our knowledge this is the first explicit lower bound for $\frac{f+1-g}{f+1}$ in terms of the embedding dimension.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.