ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Pm,n+\mathcal{P}_{m,n}^+ denote the maximum expected number of correctly guessed cards in the partial-feedback card-guessing model with mm card types and nn copies of each type. Square-root error conjecture. For every ε>0\varepsilon>0 and nn sufficiently large,

Pm,n+=m+O(m1/2+ε).\mathcal{P}_{m,n}^+=m+O(m^{1/2+\varepsilon}).

The conjecture would improve the paper's proved upper bound m+O(m3/4log⁡m)m+O(m^{3/4}\log m) and would nearly match the known lower bound m+Ω(m1/2)m+\Omega(m^{1/2}). The authors identify two parts of the proof where the current error term is oversized, so the conjecture 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.