Caterpillar and balanced species tree growth-factor conjecture
Abstract
For the source duplication-loss grammar on full binary unranked rooted species trees, with k>=1 species leaves and n extant gene leaves, prove all four claims of Conjecture4.1 (v1)/4.5 (final): one species-uniform eventual cutoff N_k makes caterpillar the count maximum and recursively leaf-balanced tree the count minimum, with equality exactly on their child-swap isomorphism classes; actual exponential growth factors exist, caterpillar growth/k tends to infinity, and balanced growth is Theta(k), explicitly 2k<=growth<=1000k for every positive k. Histories have ordered duplication, explicit speciation/loss, extant genes only at species leaves, no transfers/ranking/all-loss histories. Counts are literal finite source-event cardinalities, also transported to unranked species quotient. No asymptotic equivalent constant or caterpillar Theta(k^2) is asserted.
AI-assisted research preprint. Internal independent AI review is not external journal peer review. Exact source versions, formal coverage and bounded novelty limits are retained in the paper and supporting qualifications.
Supplementary files
Comments
Related problem 342705. Proof sources supplied as gzip+base64 proof-sources.json, extract_sources.py, and supporting.zip. No worldwide-priority certification.