Metraipolis › archive › dc_fac8988a6694
Nonexistence of a Leech Tree of Order 18: A Computer-Assisted Proof — arXiv:2609.20492
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.20492
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T04:47:25.503Z
- SHA-256 of the archived text
4ad4d0b0618bb092af45682e0c2f1c45e9159449a02594947df77a8ea4ea9bb5- Stable URL of this page
https://metraipolis.com/documento/dc_fac8988a6694
How to cite
Nonexistence of a Leech Tree of Order 18: A Computer-Assisted Proof — arXiv:2609.20492 — arXiv (en), https://arxiv.org/abs/2609.20492 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fac8988a6694 (Metraipolis archive dc_fac8988a6694, sha256 4ad4d0b0618bb092af45682e0c2f1c45e9159449a02594947df77a8ea4ea9bb5)
BibTeX
@misc{dcfac8988a6694,
title = {Nonexistence of a Leech Tree of Order 18: A Computer-Assisted Proof — arXiv:2609.20492},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.20492},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fac8988a6694; sha256 4ad4d0b0618bb092af45682e0c2f1c45e9159449a02594947df77a8ea4ea9bb5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20492. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A Leech tree of order $n$ is a tree with positive integral edge weights whose $n(n-1)/2$ pairwise weighted distances are precisely $1,2,\ldots,n(n-1)/2$. This paper gives a computer-assisted proof that no Leech tree of order $18$ exists. The argument has three layers. First, a development in Lean 4 verifies the structural facts used in the paper. These facts reduce every putative example to one of eight local configurations and justify several necessary conditions. Second, conventional mathematical arguments prove a component-pair whole-block exact-cover condition and the completeness of a recursive search. Third, exhaustive computations close all eight configurations. The computation records exact coverage, source and input hashes, terminal receipts, and checked exact-zero results. The structural layer is kernel-checked, but the search program, its execution, and the certificate checker have not been formalized in Lean. The result is therefore a computer-assisted proof, not an end-to-end Lean proof. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.20492 — 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-10T04:15:33.153Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).