Asymptotic strictness conjecture for the type of numerical monoids

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 e3e\geq 3, one has

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

for m0m\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.

Sources & referencesView supporting material

Primary source

Alessio Moscariello and Alessio Sammartano, “On minimal presentations of numerical monoids”, arXiv:2405.19810 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.