Results on the Erd os-Falconer distance problem in Zqd for odd q
Abstract
The Erd os-Falconer distance problem in Zqd asks one to show that if E ⊂ Zqd is of sufficiently large cardinality, then (E) := \(x1 - y1)2 + … + (xd - yd)2 : x, y ∈ E\ satisfies (E) = Zq. Here, Zq is the set of integers modulo q, and Zqd is the free module of rank d over Zq. We extend known results in two directions. Previous results were known only in the setting q = p, where p is an odd prime, and as such only showed that all units were obtained in the distance set. We remove the constriction that q is a power of a prime, and despite this, shows that the distance set of E contains all of Zq whenever E is sufficiently large.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.