Answers are grounded in this paper and cite their sources.
We ask whether binary identifiers and available Boolean computations uniquely determine adjacencyand what additional structure suffices for an internally defined two-dimensional lattice. On four two-bitlabels, non-isomorphic graphs demonstrate non-identifiability. The obstruction persists under a shared,quotient-coherent hierarchy of four-child refinements: both a path family and an interleaved-bit squaregrid family survive. For a countable identifier set with two named reversible transitions, commutation,independent integer normal forms, and transitivity produce a marked graph isomorphic to the standardZ2 grid; countermodels distinguish the assumptions. One finite binary numeral can code every gridnode without selecting its adjacency. We add a reconstruction fact for an already known unmarkedsquare grid: its two edge-direction families are intrinsically recognizable from four-cycles, consistentlywith Cartesian prime factorization. This does not construct the graph from labels. Intrinsic balls growas 2๐2 + 2๐ + 1, while sufficiently large cylinders and finite tori reproduce every prescribed finite-radiusneighbourhood of the infinite grid. The step metric is โ1, not a forced Euclidean metric. These areclassical mathematical mechanisms organized as a conditional BGM interface; no independent theoremnovelty or scientific priority is claimed.
No takes yet. Share an insight, caveat, or question.
A.A. Malachevsky (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: