Metraipolis › archive › dc_2b6f747febf2
Counterexamples to Aigner's majorization conjecture for star-forest search — arXiv:2609.38284
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.38284
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T14:18:57.850Z
- SHA-256 of the archived text
dc96d667e27ae96c9d8bd7e76104e9e5333b6452889db76af700ca20717af608- Stable URL of this page
https://metraipolis.com/documento/dc_2b6f747febf2
How to cite
Counterexamples to Aigner's majorization conjecture for star-forest search — arXiv:2609.38284 — arXiv (en), https://arxiv.org/abs/2609.38284 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2b6f747febf2 (Metraipolis archive dc_2b6f747febf2, sha256 dc96d667e27ae96c9d8bd7e76104e9e5333b6452889db76af700ca20717af608)
BibTeX
@misc{dc2b6f747febf2,
title = {Counterexamples to Aigner's majorization conjecture for star-forest search — arXiv:2609.38284},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.38284},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2b6f747febf2; sha256 dc96d667e27ae96c9d8bd7e76104e9e5333b6452889db76af700ca20717af608},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38284. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In adaptive quantitative group testing with exactly two defective items, each test reports how many defectives lie in a chosen subset. We study configurations in which the possible defective pairs form the edges of a star forest. Aigner proved a necessary majorization condition on the ordered star sizes for identifying the defective pair within a prescribed number of tests, and conjectured that this condition was sufficient. We disprove the conjecture by an explicit six-test counterexample and give an analytic family of counterexamples for every test budget $k\ge6$. The obstruction uses two tight prefix sums to force incompatible demands on the outcomes of the first test. We also prove, by exhaustive computation combined with analytic reductions, that the converse holds for $0\le k\le5$. Thus six is the first test budget at which majorization alone fails. The counterexamples and their infinite extension do not depend on the exhaustive computation. 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.38284 — 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.418Z 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).