Iosevich–Rudnev finite-field Falconer distance conjecture

From papers

Let Fq\mathbb{F}_q be a finite field of odd cardinality qq, let r2r\geq 2, and let EFqrE\subseteq\mathbb{F}_q^r have cardinality at least cqr2cq^{\frac{r}{2}}, where cc is sufficiently large. Define

Δ(E)={xy:x,yE},\Delta(E)=\{\|\mathbf{x}-\mathbf{y}\|:\mathbf{x},\mathbf{y}\in E\},

where z=i=1rzi2\|\mathbf{z}\|=\sum_{i=1}^r z_i^2. Iosevich–Rudnev conjecture. The distance set satisfies

#Δ(E)q.\#\Delta(E)\gg q.

This is the finite-field analogue of the Erdős–Falconer distance problem, predicting that sufficiently large subsets contain a positive-proportion number of distinct distances. The source does not provide evidence resolving the conjecture.

Progress summary

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

Sources & referencesView supporting material

Primary source

Hieu T. Ngo, “A matrix variant of the Erdős-Falconer distance problems over finite field”, arXiv:2305.13730 (2023).

Additional references

2 papers in this index state this conjecture (2010–2023). The statement above is taken from the most recent of them; the others are arXiv:1010.1597.

Solutions 0

No solutions have been posted yet.