Computational support for case-heavy proofs in mathematical phylogenetics
Populations and Evolution
2025-12-19 v1
Abstract
In this note we demonstrate that a number of case-heavy combinatorial proofs in the mathematical phylogenetics literature can be proven more compactly using computational support. We use these techniques to also prove several new combinatorial lemmas that would have taken considerable effort to prove by hand. We are optimistic that similar approaches can be deployed more widely in phylogenetics.
Cite
@article{arxiv.2512.16691,
title = {Computational support for case-heavy proofs in mathematical phylogenetics},
author = {Luca Forte and Leo van Iersel and Steven Kelk and Ruben Meuwese},
journal= {arXiv preprint arXiv:2512.16691},
year = {2025}
}
Comments
12 pages (and 14 page appendix), 5 figures