A NOTE ON THE HU–HWANG–WANG CONJECTURE FOR GROUP TESTING
- 1 October 2007
- journal article
- research article
- Published by Cambridge University Press (CUP) in The ANZIAM Journal
- Vol. 49 (4) , 561-571
Abstract
Hu et al. [“A boundary problem for group testing”, SIAM J. Algebraic Discrete Meth.2 (1981), 81–87] conjectured that the minimax test number to find d defectives in 3d items is 3d−1, a surprisingly difficult combinatorial problem about which very little is known. In this article we state three more conjectures and prove that they are all equivalent to the conjecture of Hu et al. Notably, as a byproduct, we also obtain an interesting upper bound for M(d,n).Keywords
This publication has 9 references indexed in Scilit:
- SHARPER BOUNDS IN ADAPTIVE GROUP TESTINGTaiwanese Journal of Mathematics, 2000
- On the cut-off point for combinatorial group testingDiscrete Applied Mathematics, 1999
- A new competitive algorithm for group testingDiscrete Applied Mathematics, 1994
- A tight upper bound for group testing in graphsDiscrete Applied Mathematics, 1994
- Minimizing a Combinatorial FunctionSIAM Journal on Algebraic Discrete Methods, 1982
- Hypergeometric and Generalized Hypergeometric Group TestingSIAM Journal on Algebraic Discrete Methods, 1981
- A Boundary Problem for Group TestingSIAM Journal on Algebraic Discrete Methods, 1981
- A Group Testing Problem on Two Disjoint SetsSIAM Journal on Algebraic Discrete Methods, 1981
- A Group Testing ProblemSIAM Journal on Algebraic Discrete Methods, 1980