Counting Reductions and Computational Evidence for Small Two-Stage Strict Group-Testing Instances
Year: 2026
Type: preprint
Abstract: We study deterministic two-stage strict group testing with unrestricted overlapping pools and a threshold of two positive items. We present negative-set and antichain reductions, describe a computational candidate for the minimum of ten tests at 19 items, and give a complete counting implication for 28 and 29 items. The latter implication is explicitly conditional: if at most 18 items can be handled by nine tests in two stages, then both instances require eleven tests. The 19-item exhaustive-search results are reported from project records, not newly certified here. Positive-strategy witnesses, negative-search logs and mathematical reductions are distinguished. No claim of independently certified optimality or priority is made. The work is AI-assisted and has not received independent human mathematical review or peer review. The accompanying curated source archive includes reproduction instructions, historical logs, regression checks, evidence provenance and checksums. The full 19-item search was not rerun or independently certified; the two solver implementations share enumeration and symmetry reductions. Licensing and code-provenance review remain unresolved.
Author: Duong, Steven Minh Phat
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7235949195
