First independent byte-exact reproduction of the Zinoviev-Ericson (1999) K(13) = 1154 kissing configuration in R^13, with full optimization pipeline, 13 paper-grade structural findings on dim-13 saturation, rare-paths doctrine, and dual Constructor/Auditor methodology with both-hats discipline.
linear-programming simulated-annealing sphere-packing discrete-geometry leech-lattice k13 cyclotomic-fields kissing-number steiner-system combinatorial-geometry zinoviev-ericson eisenstein-integers linear-programming-bound lattice-construction
-
Updated
May 11, 2026 - C++