Reconstruction cores in cyclic homometry: Finite intrinsic groups, spectral blocks, and local trades

How many finite point sets share exactly the same differences, counted with multiplicity? This working paper studies homometry in cyclic groups and finitely generated abelian groups, identifying reconstructions up to translation and inversion. Principal results The cyclic seven-point maximum is S(7) = 8. Every seven-point autocorrelation fibre contains at most eight inequivalent reconstructions, and an eight-class example attains the bound. The proof combines companion classification theorems, analytical reductions, and exact finite certificates. It is not an independent computation-free proof. Prime-order fibres admit a sharper analytical bound. For every prime p ≥ 11 except 302891, a seven-point fibre has at most four classes. The exceptional prime concerns this sharper bound; it does not affect S(7) = 8. The optimal consecutive Fourier-intensity bandwidth is ⌊k²/4⌋. For k ≥ 2, this many intensities makes every anchored complex fibre finite. Explicit families show that fewer cannot suffice uniformly. The theorem establishes finiteness, rather than unique reconstruction. Methods and scope Integral relation lattices preserve the torsion essential to cyclic reconstruction. Group-ring identities, character moments, Gram matrices, and algebraic counting bounds reveal the structure of complete fibres. Exact certificates resolve the remaining finite seven-point sectors, with independent implementations and unrestricted decoding checks supporting their verification. For general cardinality, the paper proves exponential counting bounds in generic and several structured regimes. The optimal bandwidth theorem also yields a general bound of exp(O(k log k)). Open questions The uniform bound S(k) ≤ exp(Ck) remains open. Its principal obstruction is counting unrestricted torsion placements, especially with heavy layers and spectral zeros. Fully analytical replacements for the seven-point certificates and the exceptional prime-order four-class case also remain unresolved. The project includes the manuscript, editable LaTeX, verification code and records, dependency documentation, and a separate corrections-and-issues account.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-16
DOI
https://doi.org/10.5281/zenodo.23426382
Primary Topic
Mathematical Analysis and Transform Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Reconstruction cores in cyclic homometry: Finite intrinsic groups, spectral blocks, and local trades

K. Fathi
Zenodo (CERN European Organization for Nuclear Research)
Mathematical Analysis and Transform Methods
article

Reconstruction cores in cyclic homometry: Finite intrinsic groups, spectral blocks, and local trades

K. Fathi
article en

Abstract

How many finite point sets share exactly the same differences, counted with multiplicity? This working paper studies homometry in cyclic groups and finitely generated abelian groups, identifying reconstructions up to translation and inversion. Principal results The cyclic seven-point maximum is S(7) = 8. Every seven-point autocorrelation fibre contains at most eight inequivalent reconstructions, and an eight-class example attains the bound. The proof combines companion classification theorems, analytical reductions, and exact finite certificates. It is not an independent computation-free proof. Prime-order fibres admit a sharper analytical bound. For every prime p ≥ 11 except 302891, a seven-point fibre has at most four classes. The exceptional prime concerns this sharper bound; it does not affect S(7) = 8. The optimal consecutive Fourier-intensity bandwidth is ⌊k²/4⌋. For k ≥ 2, this many intensities makes every anchored complex fibre finite. Explicit families show that fewer cannot suffice uniformly. The theorem establishes finiteness, rather than unique reconstruction. Methods and scope Integral relation lattices preserve the torsion essential to cyclic reconstruction. Group-ring identities, character moments, Gram matrices, and algebraic counting bounds reveal the structure of complete fibres. Exact certificates resolve the remaining finite seven-point sectors, with independent implementations and unrestricted decoding checks supporting their verification. For general cardinality, the paper proves exponential counting bounds in generic and several structured regimes. The optimal bandwidth theorem also yields a general bound of exp(O(k log k)). Open questions The uniform bound S(k) ≤ exp(Ck) remains open. Its principal obstruction is counting unrestricted torsion placements, especially with heavy layers and spectral zeros. Fully analytical replacements for the seven-point certificates and the exceptional prime-order four-class case also remain unresolved. The project includes the manuscript, editable LaTeX, verification code and records, dependency documentation, and a separate corrections-and-issues account.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 7%
Mathematical Analysis and Transform Methods
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.