ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let mm and nn denote the card multiplicity and number of card types, respectively, and let Sm,n\mathbf{S}_{m,n} be the score under an optimal strategy with Yes/No feedback. Optimal score upper-bound conjecture. For all mm and ϵ>0\epsilon>0, if nn is sufficiently large in terms of mm, then

E[Sm,n]≤(e−1)m+ϵ.\mathbb{E}[\mathbf{S}_{m,n}]\le (e-1)m+\epsilon.

This is motivated by the known asymptotic behavior of the ratio E[Sm,n]/m\mathbb{E}[\mathbf{S}_{m,n}]/m and by existing bounds, but the asserted upper bound 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.