pith. sign in

arxiv: 1111.2779 · v1 · pith:W4PU7FZRnew · submitted 2011-11-11 · 🧮 math.CO

An asymptotic result concerning a question of Wilf

classification 🧮 math.CO
keywords lambdafracasymptoticdefineepsilonholdsintegernumerical
0
0 comments X
read the original abstract

Let $\Lambda$ be a numerical semigroup with embedding dimension $e(\Lambda)$. Define $c(\Lambda)$ to be one plus the largest integer not in $\Lambda$, and define $c'(\Lambda)$ to be the number of elements in $\Lambda$ less than $c(\Lambda)$. It was asked by Wilf whether $\frac{c'(\Lambda)}{c(\Lambda)} \ge \frac{1}{e(\Lambda)}$ always holds. We prove an asymptotic version of this conjecture: we show that for a fixed positive integer $k$ and any $\epsilon > 0$, the inequality $\frac{c'(\Lambda)}{c(\Lambda)} \ge \frac{1}{k} - \epsilon$ holds for all but finitely many numerical semigroups $\Lambda$ satisfying $e(\Lambda) = k$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.