Inverse Falconer Distance Theorems over the Integer Residue Rings $\mathbb{Z}_n$
Shalender Singh, Vishnupriya Singh

TL;DR
This paper proves an inverse theorem for the Falconer distance problem over integer residue rings, revealing that sets with few distances exhibit strong algebraic structure supported on annihilator submodules.
Contribution
It introduces a novel ideal-theoretic rigidity principle and a divisor-depth decomposition for $Z_n$, providing the first inverse theorem for composite moduli.
Findings
Sets with few distances are supported on cosets of annihilator submodules.
Near-extremizers exhibit algebraic degeneracy in the distance form.
Complete classification of near-extremizers shows a rigidity phenomenon.
Abstract
We establish an ideal-theoretic rigidity principle for quadratic distance images over integer residue rings. Specifically, we prove that near-extremal collapse of the distance set in forces strong algebraic structure supported on annihilator submodules arising from the arithmetic of . As a consequence, we obtain the first inverse theorem for the Falconer distance problem over for composite moduli. We show that if a set of size determines only distinct squared distances, then must be supported on a coset of an annihilator submodule on which the distance form is algebraically degenerate. The proof introduces a divisor-depth decomposition intrinsic to , together with a lifting mechanism that transfers local degeneracies at prime moduli into global ideal-theoretic constraints.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Algebraic Geometry and Number Theory · Polynomial and algebraic computation
