Skip to main content Accessibility help
×
Home

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

  • MING-GUANG LEU (a1)

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).

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

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

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

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

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

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

Copyright

References

Hide All
[1]Ahlswede, R. and Wegener, I., Search problems (John Wiley and Sons, New York, 1987).
[2]Aigner, M., Combinatorial search (John Wiley and Sons, New York, 1988).
[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) 486493.
[4]Bar-Noy, A., Hwang, F. K., Kessler, I. and Kutten, S., “A new competitive algorithm for group testing”, Discrete Appl. Math. 52 (1994) 2938.
[5]Chang, G. J. and Hwang, F. K., “A group testing problem”, SIAM J. Algebraic Discrete Meth. 1 (1980) 2124.
[6]Chang, G. J. and Hwang, F. K., “A group testing problem on two disjoint sets”, SIAM J. Algebraic Discrete Meth. 2 (1981) 3538.
[7]Damaschke, P., “A tight upper bound for group testing in graphs”, Discrete Appl. Math. 48 (1994) 101109.
[8]Du, D. Z. and Hwang, F. K., “Minimizing a combinatorial function”, SIAM J. Algebraic Discrete Meth. 3 (1982) 523528.
[9]Du, D. Z. and Hwang, F. K., Combinatorial group testing and its applications, 2nd edn (World Scientific, Singapore, 2000).
[10]Fischer, P., Klasner, N. and Wegener, I., “On the cut-off point for combinatorial group testing”, Discrete Appl. Math. 91 (1999) 8392.
[11]Hu, M. C., Hwang, F. K. and Wang, J. K., “A boundary problem for group testing”, SIAM J. Algebraic Discrete Meth. 2 (1981) 8187.
[12]Hwang, F. K., Song, T. T. and Du, D. Z., “Hypergeometric and generalized hypergeometric group testing”, SIAM J. Algebraic Discrete Meth. 2 (1981) 426428.
[13]Juan, S.-T., “Group testing problems”, Ph. D. Thesis, National Chiao Tung University, Hsinchu, Taiwan, 2000.
[14]Leu, M.-G., Lin, C.-Y. and Weng, S.-Y., “Note on a conjecture for group testing”, Ars Combin. 64 (2002) 2932.
[15]Riccio, L. and Colbourn, C. J., “Sharper bounds in adaptive group testing”, Taiwanese J. Math. 4 (2000) 669673.
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

Keywords

MSC classification

Related content

Powered by UNSILO

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

  • MING-GUANG LEU (a1)

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.