Mathematics – Combinatorics
Scientific paper
2011-11-11
Mathematics
Combinatorics
9 pages, submitted to Semigroup Forum
Scientific paper
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$.
No associations
LandOfFree
An asymptotic result concerning a question of Wilf does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An asymptotic result concerning a question of Wilf, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An asymptotic result concerning a question of Wilf will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-139943