Computational support for case-heavy proofs in mathematical phylogenetics

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.

12 pages (and 14 page appendix), 5 figures