Pith. sign in

REVIEW

An asymptotic result concerning a question of Wilf

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1111.2779 v1 pith:W4PU7FZR submitted 2011-11-11 math.CO

classification math.CO
keywords lambdafracasymptoticdefineepsilonholdsintegernumerical
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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$.

Discussion (0). Continue with ORCID to comment.

Pith tools