ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let g(n,k,α,m)g(n,k,\alpha,m) denote the minimum number of group-testing queries in the model considered, and let aa be the query-size parameter. Assume that 1α\frac{1}{\alpha} is an integer and

k+log⁡k+1≤⌈na⌉.k+\log k+1\leq \left\lceil \frac{n}{a}\right\rceil.

Optimality conjecture. Under these assumptions, the algorithm used in the proof of Theorem uj1 is optimal for m=1m=1. The preceding discussion indicates that the algorithm seems optimal under the stated condition, while noting counterexamples when 1/α1/\alpha is not an integer; the exact values of g(n,k,α,m)g(n,k,\alpha,m) are otherwise difficult to determine.

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.