Iosevich–Rudnev distance-set conjecture over finite fields

At least 3 years old · documented by

Let Fqd\mathbb F_q^d be the dd-dimensional vector space over the finite field Fq\mathbb F_q, where qq is odd. For E⊆FqdE\subseteq\mathbb F_q^d, define the distance set by

Δ(E)={∣∣x−y∣∣:x,y∈E},\Delta(E)=\{||x-y||:x,y\in E\},

where

∣∣α∣∣=∑j=1dαj2||\alpha||=\sum_{j=1}^d\alpha_j^2

for α=(α1,…,αd)∈Fqd\alpha=(\alpha_1,\ldots,\alpha_d)\in\mathbb F_q^d, and ∣Δ(E)∣∼q|\Delta(E)|\sim q means that the distance set has size comparable to qq. Iosevich–Rudnev's conjecture. Let E⊆FqdE\subseteq\mathbb F_q^d. Suppose that d≥2d\geq 2 is even or d,q≡3(mod4)d,q\equiv 3\pmod{4}. Then, if ∣E∣≥Cqd/2|E|\geq Cq^{d/2} for a sufficiently large constant C>0C>0, one has

∣Δ(E)∣∼q.|\Delta(E)|\sim q.

The previously known threshold is ∣E∣≥Cq(d+1)/2|E|\geq Cq^{(d+1)/2}; the conjecture predicts the improved exponent d/2d/2 in the stated cases. The claim concerns when a set determines a positive proportion of all possible finite-field distances and remains unresolved in the source.

References

Primary source

Doowon Koh, “Note on the pinned distance problem over finite fields”, arXiv:2208.07781 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.