ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let mopt(n)m_\mathrm{opt}(n) be the value of mm minimizing the long-run average search-plus-cleanup cost, and let m~opt(n)\widetilde m_\mathrm{opt}(n) minimize the corresponding approximate cost F~(m)\widetilde F(m) in the complete-memory, numbered-shelves model M4\mathcal M_4.

Approximate-threshold conjecture. We have

mopt(n)⩾m~opt(n).m_\mathrm{opt}(n)\geqslant \widetilde m_\mathrm{opt}(n).

The approximate problem is analyzed explicitly, with m~opt(n)\widetilde m_\mathrm{opt}(n) lying near 3log⁡2(n)3\log_2(n). The conjecture asserts that this computable approximate threshold is a lower bound for the true optimal threshold; the paper reports numerical support, but no proof is given.

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.