Computational support for case-heavy proofs in mathematical phylogenetics
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908720218243072 |
|---|---|
| author | Forte, Luca van Iersel, Leo Kelk, Steven Meuwese, Ruben |
| author_facet | Forte, Luca van Iersel, Leo Kelk, Steven Meuwese, Ruben |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_16691 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Computational support for case-heavy proofs in mathematical phylogenetics Forte, Luca van Iersel, Leo Kelk, Steven Meuwese, Ruben Populations and Evolution 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. |
| title | Computational support for case-heavy proofs in mathematical phylogenetics |
| topic | Populations and Evolution |
| url | https://arxiv.org/abs/2512.16691 |