Finite Coframes Without Spacetime: Symmetry Obstructions on Recursive Cubic Graph

We construct a redundant three-line discrete coframe on iterated triangle replacements of a properly three-edge-coloured cubic graph. Starting from K4, a missing-colour rule preserves one instance of each unoriented equiangular line at every refined star. Eisenstein-lattice corner differences give exact unit edge representatives and close each designated triangular face. A flat connection obeys reversal and transforms covariantly under local orthogonal changes of frame. We prove the all-level construction by induction and distinguish it from a global isometric embedding. We then state conditional limits on interpretation: a collapse-natural scalar invariant under the seed action is constant; the full line symmetry has no nonzero invariant signed vector; and an invariant symmetric bilinear form in the declared two-dimensional representation is definite or degenerate. No dimensional conversion factor is fixed by dimensionless unit edges. The recovered computational implementation passes nine supplied tests, with levels zero through three covering 160 vertices, 240 edges and 52 designated faces in total. The contribution is a self-contained finite construction and a precise account of its interpretive limits, rather than a derivation of physical spacetime or a general impossibility theorem for emergence.

Authors

Publication Details

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

Finite Coframes Without Spacetime: Symmetry Obstructions on Recursive Cubic Graph

Marco Gericke
Zenodo (CERN European Organization for Nuclear Research)
Mathematics and Applications
preprint

Finite Coframes Without Spacetime: Symmetry Obstructions on Recursive Cubic Graph

Marco Gericke
preprint en

Abstract

We construct a redundant three-line discrete coframe on iterated triangle replacements of a properly three-edge-coloured cubic graph. Starting from K4, a missing-colour rule preserves one instance of each unoriented equiangular line at every refined star. Eisenstein-lattice corner differences give exact unit edge representatives and close each designated triangular face. A flat connection obeys reversal and transforms covariantly under local orthogonal changes of frame. We prove the all-level construction by induction and distinguish it from a global isometric embedding. We then state conditional limits on interpretation: a collapse-natural scalar invariant under the seed action is constant; the full line symmetry has no nonzero invariant signed vector; and an invariant symmetric bilinear form in the declared two-dimensional representation is definite or degenerate. No dimensional conversion factor is fixed by dimensionless unit edges. The recovered computational implementation passes nine supplied tests, with levels zero through three covering 160 vertices, 240 edges and 52 designated faces in total. The contribution is a self-contained finite construction and a precise account of its interpretive limits, rather than a derivation of physical spacetime or a general impossibility theorem for emergence.

Zenodo (CERN European Organization for Nuclear Research)
Mathematics 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