Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-27T10:55:07.286Z Has data issue: false hasContentIssue false
  • English
  • Français

A NOTE ON THE HU–HWANG–WANG CONJECTURE FOR GROUP TESTING

Part of: Operations research and management science Graph theory Combinatorics

Published online by Cambridge University Press:  01 April 2008

MING-GUANG LEU
MING-GUANG LEU*
Affiliation:
Department of Mathematics, National Central University, Chung-Li 32054, Taiwan (email: mleu@math.ncu.edu.tw)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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

group testingalgorithm

MSC classification

Secondary: 05A15: Exact enumeration problems, generating functions 05C99: None of the above, but in this section 90B25: Reliability, availability, maintenance, inspection
Type
Research Article
Information
The ANZIAM Journal , Volume 49 , Issue 4 , April 2008 , pp. 561 - 571
Copyright
Copyright © Australian Mathematical Society 2008

References

[1]Ahlswede, R. and Wegener, I., Search problems (John Wiley and Sons, New York, 1987).Google Scholar
[2]Aigner, M., Combinatorial search (John Wiley and Sons, New York, 1988).Google Scholar
[3]Aslam, J. A. and Dhagat, A., “Searching in the presence of linearly bounded errors”, in Proc. 23rd ACM Symp. on theory of computing, New Orleans, LA, 1991 (ACM Press, New York, 1991) 486–493.Google Scholar
[4]Bar-Noy, A., Hwang, F. K., Kessler, I. and Kutten, S., “A new competitive algorithm for group testing”, Discrete Appl. Math. 52 (1994) 29–38.CrossRefGoogle Scholar
[5]Chang, G. J. and Hwang, F. K., “A group testing problem”, SIAM J. Algebraic Discrete Meth. 1 (1980) 21–24.CrossRefGoogle Scholar
[6]Chang, G. J. and Hwang, F. K., “A group testing problem on two disjoint sets”, SIAM J. Algebraic Discrete Meth. 2 (1981) 35–38.CrossRefGoogle Scholar
[7]Damaschke, P., “A tight upper bound for group testing in graphs”, Discrete Appl. Math. 48 (1994) 101–109.CrossRefGoogle Scholar
[8]Du, D. Z. and Hwang, F. K., “Minimizing a combinatorial function”, SIAM J. Algebraic Discrete Meth. 3 (1982) 523–528.CrossRefGoogle Scholar
[9]Du, D. Z. and Hwang, F. K., Combinatorial group testing and its applications, 2nd edn (World Scientific, Singapore, 2000).Google Scholar
[10]Fischer, P., Klasner, N. and Wegener, I., “On the cut-off point for combinatorial group testing”, Discrete Appl. Math. 91 (1999) 83–92.CrossRefGoogle Scholar
[11]Hu, M. C., Hwang, F. K. and Wang, J. K., “A boundary problem for group testing”, SIAM J. Algebraic Discrete Meth. 2 (1981) 81–87.CrossRefGoogle Scholar
[12]Hwang, F. K., Song, T. T. and Du, D. Z., “Hypergeometric and generalized hypergeometric group testing”, SIAM J. Algebraic Discrete Meth. 2 (1981) 426–428.CrossRefGoogle Scholar
[13]Juan, S.-T., “Group testing problems”, Ph. D. Thesis, National Chiao Tung University, Hsinchu, Taiwan, 2000.Google Scholar
[14]Leu, M.-G., Lin, C.-Y. and Weng, S.-Y., “Note on a conjecture for group testing”, Ars Combin. 64 (2002) 29–32.Google Scholar
[15]Riccio, L. and Colbourn, C. J., “Sharper bounds in adaptive group testing”, Taiwanese J. Math. 4 (2000) 669–673.CrossRefGoogle Scholar