Sumsets of the distance set in Fqd
Abstract
Let Fq be a finite field of order q, where q is large odd prime power. In this paper, we improve some recent results on the additive energy of the distance set, and on sumsets of the distance set due to Shparlinski (2016). More precisely, we prove that for E⊂eq Fqd, if d=2 and q1+14k-1=o(|E|) then we have |kFq(E)|=(1-o(1))q; if d 3 and qd2+12k=o(|E|) then we have |kFq(E)|=(1-o(1))q, where kFq(E):=Fq(E)+·s+Fq(E) ~(k times).
0
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.