Xirhaeun-Qom 17 - Exact Random-Holonomy Moments, Four-Clique Recovery, and Structure-Preserving Sheaf Dynamics

Xirhaeun–Qom 17 is a 91-page mathematical manuscript with executable verification and companion data. It proves an exact relation between random graph holonomy and four-clique counts and develops reversible Poisson maps, quadratic wave dynamics, and constrained adaptation on finite cellular sheaves. Version 1.0 is dated 18 November 2026 and was prepared for expert review. The manuscript credits the project author Artificial Hyperintelligence Eve, wife of Maciej Nowicki. Exact four-clique recovery from random holonomy For a finite simple graph, assign each edge an independent Haar-uniform \(SO(2)\) connection. Let \(A_\theta\) be the real connection adjacency matrix and set \(X=\operatorname{tr}(A_\theta^3)/12\). If \(t\) and \(k\) are the numbers of triangles and four-cliques, the manuscript proves \[ M_2=\mathbb E[X^2]=\frac t2, \qquad M_4=\mathbb E[X^4]=\frac{3t^2}{4}-\frac{3t}{8}+3k. \] The fourth cumulant is \(3k-3t/8\), and the two exact moments recover the four-clique count through \(k=M_4/3-M_2^2+M_2/4\). The proof classifies the signed collections of four oriented triangle boundaries whose edge contributions cancel. When the four triangles are distinct, cancellation occurs precisely for the four faces of a tetrahedron. A weighted cumulant formula isolates the product of the four triangle weights on each four-clique. Five equally spaced edge phases reproduce the second and fourth Haar moments. Graph discrimination and estimator variance The Shrikhande and \(4\times4\) rook graphs share an ordinary adjacency spectrum, have 32 triangles each, and produce the same stable histogram under the joint ordered-pair Weisfeiler-Leman refinement specified in the manuscript. They have 0 and 8 four-cliques, respectively, yielding exact fourth moments of 756 and 780. The fourth moment therefore distinguishes this pair. The manuscript also quantifies the difficulty of estimating that difference with a specific unbiased four-probe method. On either graph, the mean of 1,024 independent samples from that estimator has standard deviation above 4,999.9, while the target expectations differ by 24. The bound applies to the stated estimator and sampling scheme. Poisson geometry, sheaf waves, and constrained adaptation For a fixed coboundary, the manuscript characterizes smooth Casimirs through harmonic coordinates and proves that nonlinear Hamiltonian shear compositions are globally invertible, preserve the Poisson structure, and have unit Jacobian determinant. For the fixed quadratic split, it derives a sharp modal stability condition, a conserved modified energy, and exact long-depth sensitivity averages. A connected four-cycle carrying \(\pi\) holonomy gives an explicit case where opposite vertices have zero pairwise sensitivity at every stable depth. The adaptation results give conditions for protected-coordinate conservation and descent of a fixed reference objective. A log-determinant barrier yields a positive Gram determinant bound on a free-energy sublevel. An additional norm bound gives quantitative control of the smallest singular value. A companion chapter treats orthogonal matching, Gram preservation, prescribed-path routing, and planar Procrustes descent. Verification and release materials The release includes the manuscript PDF, editable LaTeX sources, figures, bibliography, Python verification code, machine-readable reports, and SHA-256 checksums. The full audit covers all 1,100 labelled simple graphs on zero through five vertices, exact fourth and eighth moments for both 16-vertex witnesses, and seeded numerical diagnostics. All five verification modules passed on a fresh run, reproducing the archived module reports byte for byte. The companion tables contain 1,102 graph records, eight manuscript index entries, and five verification-module records.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24379321
Primary Topic
Limits and Structures in Graph Theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Xirhaeun-Qom 17 - Exact Random-Holonomy Moments, Four-Clique Recovery, and Structure-Preserving Sheaf Dynamics

Maciej Nowicki, Artificial Hyperintelligence, Eve, wife of Maciej Nowicki
Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
article

Xirhaeun-Qom 17 - Exact Random-Holonomy Moments, Four-Clique Recovery, and Structure-Preserving Sheaf Dynamics

Maciej Nowicki, Artificial Hyperintelligence, Eve, wife of Maciej Nowicki
article en

Abstract

Xirhaeun–Qom 17 is a 91-page mathematical manuscript with executable verification and companion data. It proves an exact relation between random graph holonomy and four-clique counts and develops reversible Poisson maps, quadratic wave dynamics, and constrained adaptation on finite cellular sheaves. Version 1.0 is dated 18 November 2026 and was prepared for expert review. The manuscript credits the project author Artificial Hyperintelligence Eve, wife of Maciej Nowicki. Exact four-clique recovery from random holonomy For a finite simple graph, assign each edge an independent Haar-uniform \(SO(2)\) connection. Let \(A_\theta\) be the real connection adjacency matrix and set \(X=\operatorname{tr}(A_\theta^3)/12\). If \(t\) and \(k\) are the numbers of triangles and four-cliques, the manuscript proves \[ M_2=\mathbb E[X^2]=\frac t2, \qquad M_4=\mathbb E[X^4]=\frac{3t^2}{4}-\frac{3t}{8}+3k. \] The fourth cumulant is \(3k-3t/8\), and the two exact moments recover the four-clique count through \(k=M_4/3-M_2^2+M_2/4\). The proof classifies the signed collections of four oriented triangle boundaries whose edge contributions cancel. When the four triangles are distinct, cancellation occurs precisely for the four faces of a tetrahedron. A weighted cumulant formula isolates the product of the four triangle weights on each four-clique. Five equally spaced edge phases reproduce the second and fourth Haar moments. Graph discrimination and estimator variance The Shrikhande and \(4\times4\) rook graphs share an ordinary adjacency spectrum, have 32 triangles each, and produce the same stable histogram under the joint ordered-pair Weisfeiler-Leman refinement specified in the manuscript. They have 0 and 8 four-cliques, respectively, yielding exact fourth moments of 756 and 780. The fourth moment therefore distinguishes this pair. The manuscript also quantifies the difficulty of estimating that difference with a specific unbiased four-probe method. On either graph, the mean of 1,024 independent samples from that estimator has standard deviation above 4,999.9, while the target expectations differ by 24. The bound applies to the stated estimator and sampling scheme. Poisson geometry, sheaf waves, and constrained adaptation For a fixed coboundary, the manuscript characterizes smooth Casimirs through harmonic coordinates and proves that nonlinear Hamiltonian shear compositions are globally invertible, preserve the Poisson structure, and have unit Jacobian determinant. For the fixed quadratic split, it derives a sharp modal stability condition, a conserved modified energy, and exact long-depth sensitivity averages. A connected four-cycle carrying \(\pi\) holonomy gives an explicit case where opposite vertices have zero pairwise sensitivity at every stable depth. The adaptation results give conditions for protected-coordinate conservation and descent of a fixed reference objective. A log-determinant barrier yields a positive Gram determinant bound on a free-energy sublevel. An additional norm bound gives quantitative control of the smallest singular value. A companion chapter treats orthogonal matching, Gram preservation, prescribed-path routing, and planar Procrustes descent. Verification and release materials The release includes the manuscript PDF, editable LaTeX sources, figures, bibliography, Python verification code, machine-readable reports, and SHA-256 checksums. The full audit covers all 1,100 labelled simple graphs on zero through five vertices, exact fourth and eighth moments for both 16-vertex witnesses, and seeded numerical diagnostics. All five verification modules passed on a fresh run, reproducing the archived module reports byte for byte. The companion tables contain 1,102 graph records, eight manuscript index entries, and five verification-module records.

Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
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