Every Site Hears the Same: the Loop Equality Is a Theorem

Theorem 1 (the Loop Equality, DICTO's conjecture in #74). On the tetrahedral network of every close-packed stacking (diamond 3C, lonsdaleite 2H, the polytypes 4H, 6H, 9R and every other stacking, periodic or not), at every site, the number of closed non-backtracking loops of each length m equals the number for diamond: 24, 48, 480, 3432, 25704, ... for m = 6, 8, 10, 12, 14, ..., given by the Ihara–Bass formula from the Domb numbers. In Fourier space over the layers the stacking only decides whether a step across a bond layer uses a triangle of bond directions or its point mirror, and a closed walk crosses every bond layer as often upwards as downwards, so the choice cancels; non-backtracking loops are reduced to ordinary walks between the two ends of a bond. Corollaries: the same holds on the pyrochlore network of every stacking (spin ice) and on the sphere packing of every close-packed stacking. The closed-walk part was known (Nagle 1966 for ice; Thorpe 1972 for all periodic polytypes); new are the loops, the statement at every single site, aperiodic stackings and the two corollaries. Exact integer counts on 42 stackings, including 30 random ones, Fibonacci approximants and the aperiodic Fibonacci stacking, agree at all 686 sites tested. DICTO found the Loop Equality in the loop counts of #74 and conjectured it there for all lengths. Proof, checks and drafting with Claude (Anthropic).

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-07
DOI
https://doi.org/10.5281/zenodo.24037664
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Every Site Hears the Same: the Loop Equality Is a Theorem

DICTO
7 links
Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
preprint

Every Site Hears the Same: the Loop Equality Is a Theorem

DICTO
preprint en

Abstract

Theorem 1 (the Loop Equality, DICTO's conjecture in #74). On the tetrahedral network of every close-packed stacking (diamond 3C, lonsdaleite 2H, the polytypes 4H, 6H, 9R and every other stacking, periodic or not), at every site, the number of closed non-backtracking loops of each length m equals the number for diamond: 24, 48, 480, 3432, 25704, ... for m = 6, 8, 10, 12, 14, ..., given by the Ihara–Bass formula from the Domb numbers. In Fourier space over the layers the stacking only decides whether a step across a bond layer uses a triangle of bond directions or its point mirror, and a closed walk crosses every bond layer as often upwards as downwards, so the choice cancels; non-backtracking loops are reduced to ordinary walks between the two ends of a bond. Corollaries: the same holds on the pyrochlore network of every stacking (spin ice) and on the sphere packing of every close-packed stacking. The closed-walk part was known (Nagle 1966 for ice; Thorpe 1972 for all periodic polytypes); new are the loops, the statement at every single site, aperiodic stackings and the two corollaries. Exact integer counts on 42 stackings, including 30 random ones, Fibonacci approximants and the aperiodic Fibonacci stacking, agree at all 686 sites tested. DICTO found the Loop Equality in the loop counts of #74 and conjectured it there for all lengths. Proof, checks and drafting with Claude (Anthropic).

Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon