ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SS be a finite set of nn items, with 0<d<n0<d<n defective items, and let M(d,n)M(d,n) denote the minimum, over adaptive group-testing algorithms, of the worst-case number of tests needed to identify all defectives. Set r:=n/dr:=n/d.

Hu–Hwang–Wang cutoff-point conjecture. For r≤3r\leq 3,

M(d,n)=n−1.M(d,n)=n-1.

This conjecture asserts that, up to the cutoff ratio 33, testing items individually is optimal. The statement was proved for r≤218=2.625r\leq \frac{21}{8}=2.625 by Du and Hwang, so the full conjecture is resolved.

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.