ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be the number of objects and let mopt(n)m_\mathrm{opt}(n) denote the value of mm minimizing the long-run average search-plus-cleanup cost in the complete-memory, numbered-shelves model M4\mathcal M_4. Write b(n)=log⁡2(n+1)b(n)=\log_2(n+1).

Optimal cleanup threshold conjecture. For n⩾5n\geqslant 5, we have

mopt(n)⩾3b(n)−32,m_\mathrm{opt}(n)\geqslant 3b(n)-\tfrac{3}{2},

and, asymptotically,

mopt(n)∼3b(n)∼3log⁡2(n).m_\mathrm{opt}(n)\sim 3b(n)\sim 3\log_2(n).

The paper establishes the corresponding upper bound mopt(n)<4b(n)m_\mathrm{opt}(n)<4b(n) and proves the sharper bounds for the approximate optimization problem. The lower bound and the asymptotic behavior for the original problem are supported by numerical evidence but remain conjectural.

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.