Homometry and the Reconstruction of Relations: Admissibility, information, and stable reconstruction

Autocorrelation preserves pair differences while concealing how they fit together. Homometry and the Reconstruction of Relations studies this lost information through Fourier phases, finite alphabets, and invariant observations. Its principal binary construction has exactly four translation classes on the seven-dimensional binary vector space. Four cubic Fourier readouts recover two independent bits, their AND, and their OR. The resulting classical four-atom law violates the Ingleton inequality for abelian coset variables. The proof recovers every partner from the autocorrelation itself, using a quadratic Pfaffian relation and intrinsically determined affine-plane markers. A faithful product construction combines complete binary fibres and preserves their cubic readouts, giving arbitrarily many independent copies of this information pattern. Arithmetic restrictions and exact Fourier-sign congruences delimit further constructions. Full binary universality is reduced conditionally to an equality-pinning operation that retains exactly the classes satisfying a chosen bit equality; that operation remains unproved. When positive-integer alphabets may be engineered, a separate theorem realizes every finite Boolean relation and every rational joint law of binary readouts. A finite reduced reconstruction algebra describes admissible translation classes and determines observable multiplicities, Shannon entropy, collision entropy, and error–erasure certificates. On a fixed phase torus, the paper gives the sharp number of unrestricted monomial observations needed to correct one arbitrary error. Across changing Fourier supports, amplitude-weighted phase measurements are globally stable precisely when their integer relations generate the full lattice on every support. A cyclic example separates measurement count from precision. The companion, Relations, Geometry, and Controlled Observation, proves obstructions to several binary encodings and develops cyclic incidence tests with explicit classical super-Vandermonde attribution. A consecutive Fourier-zero criterion recognizes Singer supports at prime order; additional coefficient data give the prime-power criterion. A lacunary polynomial question and a sharp Galois-averaged routing gap isolate further requirements without proving general cyclic rigidity. Independent sections connect homometry to polygon shadows, winding, compatible memory, harmonic depth, ordered signatures, positive support certificates, passive masks, and response identifiability. Arbitrary binary universality, general cyclic-plane rigidity, efficient uniform reconstruction, and stable physical access to the modified measurements remain open. The project includes both papers, editable sources, vector figures, reproducible exact checks, a separate scope and corrections report, and the preserved source collection. Computational classifications and numerical illustrations are distinguished from analytical theorems; no general historical-priority claim is made.

Authors

Publication Details

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

Homometry and the Reconstruction of Relations: Admissibility, information, and stable reconstruction

K. Fathi
Zenodo (CERN European Organization for Nuclear Research)
Coding theory and cryptography
article

Homometry and the Reconstruction of Relations: Admissibility, information, and stable reconstruction

K. Fathi
article en

Abstract

Autocorrelation preserves pair differences while concealing how they fit together. Homometry and the Reconstruction of Relations studies this lost information through Fourier phases, finite alphabets, and invariant observations. Its principal binary construction has exactly four translation classes on the seven-dimensional binary vector space. Four cubic Fourier readouts recover two independent bits, their AND, and their OR. The resulting classical four-atom law violates the Ingleton inequality for abelian coset variables. The proof recovers every partner from the autocorrelation itself, using a quadratic Pfaffian relation and intrinsically determined affine-plane markers. A faithful product construction combines complete binary fibres and preserves their cubic readouts, giving arbitrarily many independent copies of this information pattern. Arithmetic restrictions and exact Fourier-sign congruences delimit further constructions. Full binary universality is reduced conditionally to an equality-pinning operation that retains exactly the classes satisfying a chosen bit equality; that operation remains unproved. When positive-integer alphabets may be engineered, a separate theorem realizes every finite Boolean relation and every rational joint law of binary readouts. A finite reduced reconstruction algebra describes admissible translation classes and determines observable multiplicities, Shannon entropy, collision entropy, and error–erasure certificates. On a fixed phase torus, the paper gives the sharp number of unrestricted monomial observations needed to correct one arbitrary error. Across changing Fourier supports, amplitude-weighted phase measurements are globally stable precisely when their integer relations generate the full lattice on every support. A cyclic example separates measurement count from precision. The companion, Relations, Geometry, and Controlled Observation, proves obstructions to several binary encodings and develops cyclic incidence tests with explicit classical super-Vandermonde attribution. A consecutive Fourier-zero criterion recognizes Singer supports at prime order; additional coefficient data give the prime-power criterion. A lacunary polynomial question and a sharp Galois-averaged routing gap isolate further requirements without proving general cyclic rigidity. Independent sections connect homometry to polygon shadows, winding, compatible memory, harmonic depth, ordered signatures, positive support certificates, passive masks, and response identifiability. Arbitrary binary universality, general cyclic-plane rigidity, efficient uniform reconstruction, and stable physical access to the modified measurements remain open. The project includes both papers, editable sources, vector figures, reproducible exact checks, a separate scope and corrections report, and the preserved source collection. Computational classifications and numerical illustrations are distinguished from analytical theorems; no general historical-priority claim is made.

Zenodo (CERN European Organization for Nuclear Research)
Coding theory and cryptography
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