Testing Full Quartet Consistency: Adaptive Reconstruction, Random Verification, and Constant-Query Testability
arXiv:2608.00987
Abstract
We study dense property testing for full systems of resolved quartet topologies on taxa: determining whether a system is induced by a phylogenetic tree or is -far from every tree-induced system. Our main result is an explicit polynomial-time adaptive one-sided-error tester. It reconstructs a candidate tree through anchored quartet queries and verifies the candidate using uniformly random quartet queries. With error probability , it uses queries. We also give a non-adaptive cached-anchor variant using queries. Both improve the previous explicit query bound. Since the input contains quartet entries, both testers use queries for fixed~ and~. We additionally encode full quartet systems, equivariantly under relabeling, as directed, three-colored -ary structures. Hereditary directed-hypergraph testing then yields an -independent one-sided-error tester, although its dependence on is quantitatively impractical. Finally, we prove lower bounds. In ordinary property testing, every adaptive randomized tester, even with two-sided error, requires asymptotically at least queries as . Every one-sided-error tester requires queries, matching the random-verification term up to rounding. For the stronger reconstruct-or-reject task, our upper bounds are optimal up to constant factors: the adaptive and non-adaptive complexities are and , respectively.
Submitted to a journal for publication