Metraipolis › archive › dc_28485dfe3482

A Short Combinatorial Proof of the Pons-Batle Identity for Counting Tree-Child Networks — arXiv:2609.04979

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.04979
License (as archived)
CC0-1.0
Archived
2026-10-16T23:21:03.108Z
SHA-256 of the archived text
a937de15fe0d9a67c643e463e1840d9076063863ea9ba55e1470d6fee6819efe
Stable URL of this page
https://metraipolis.com/documento/dc_28485dfe3482

How to cite

A Short Combinatorial Proof of the Pons-Batle Identity for Counting Tree-Child Networks — arXiv:2609.04979 — arXiv (en), https://arxiv.org/abs/2609.04979 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_28485dfe3482 (Metraipolis archive dc_28485dfe3482, sha256 a937de15fe0d9a67c643e463e1840d9076063863ea9ba55e1470d6fee6819efe)
BibTeX
@misc{dc28485dfe3482,
  title = {A Short Combinatorial Proof of the Pons-Batle Identity for Counting Tree-Child Networks — arXiv:2609.04979},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.04979},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_28485dfe3482; sha256 a937de15fe0d9a67c643e463e1840d9076063863ea9ba55e1470d6fee6819efe},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.04979. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Tree-child networks are a useful class of binary phylogenetic networks. The Pons--Batle identity (Pons and Batle, \textit{Scientific Reports}, 2021) states that the number $a_{n,k}$ of tree-child networks with $k$ reticulations on $n$ taxa satisfies \[ a_{n,k}=(n-k+1)a_{n,k-1} +\frac{n(2n+k-3)}{n-k}a_{n-1,k}. \] In this paper, we present a short combinatorial proof of this identity.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-07 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Populations and Evolution (q-bio.PE).
Pagina del lavoro: https://arxiv.org/abs/2609.04979 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T23:03:13.254Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).