Metraipolis › archive › dc_dbb3bd22d135
Certified exact bounds for adaptive quantitative group testing with two defectives — arXiv:2609.38489
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.38489
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T14:18:59.990Z
- SHA-256 of the archived text
b7af1341fc84b53159a1c870947cf94cf5790310e0af9db09a6bd52e78eced57- Stable URL of this page
https://metraipolis.com/documento/dc_dbb3bd22d135
How to cite
Certified exact bounds for adaptive quantitative group testing with two defectives — arXiv:2609.38489 — arXiv (en), https://arxiv.org/abs/2609.38489 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dbb3bd22d135 (Metraipolis archive dc_dbb3bd22d135, sha256 b7af1341fc84b53159a1c870947cf94cf5790310e0af9db09a6bd52e78eced57)
BibTeX
@misc{dcdbb3bd22d135,
title = {Certified exact bounds for adaptive quantitative group testing with two defectives — arXiv:2609.38489},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.38489},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dbb3bd22d135; sha256 b7af1341fc84b53159a1c870947cf94cf5790310e0af9db09a6bd52e78eced57},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38489. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We determine the maximum population size for which exactly two defective items can always be identified using at most $k$ adaptive quantitative tests, for every $0\le k\le10$. Each test reports the number of defectives in a chosen subset. The exact maxima for eight, nine and ten tests are 65, 112 and 192, respectively. We also classify all pairs of sizes of two disjoint sets, each containing exactly one defective, that can be resolved within each test budget through eight. These exact results are supported by explicit strategies and maximality certificates checked by programs separate from the search implementation. Additional results include partial nine-test boundaries and an eleven-test strategy for 328 items; maximality of the latter remains open. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.38489 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T14:05:16.422Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).