ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T(e,m)\mathscr{T}(e,m) and D(e,m)\mathscr{D}(e,m) denote the functions defined in the paper for the type and the relevant upper bound of numerical monoids. Asymptotic strictness conjecture. For any fixed value of e≥3e\geq 3, one has

T(e,m)<D(e,m)\mathscr{T}(e,m)<\mathscr{D}(e,m)

for m≫0m\gg0. The conjecture proposes that the upper bound for the type is eventually not attained, in analogy with the corresponding asymptotic result for the related function; the preceding corollaries establish equality in several other regimes, but the stated asymptotic strict inequality remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.