English

Erdős--Falconer distance conjecture from an analytic perspective

Combinatorics 2026-07-07 v1

Abstract

Let qq be an odd prime power and let V=\Fq2mV=\F_q^{2m}, equipped with Q(x)=x12++x2m2Q(x)=x_1^2+\cdots+x_{2m}^2. We develop a semidefinite Delsarte framework for the two-set Erd\H{o}s--Falconer distance problem over VV. The framework reduces the natural qmq^m-scale positive-proportion theorem to a uniform L1L^1 anti-concentration statement for positive convex combinations of classical Kloosterman sums. Assuming this Kloosterman anti-concentration conjecture, we prove that for every 0<α<120<\alpha<\frac{1}{2} there is a constant Cm,αC_{m,\alpha} such that min{E,F}Cm,αqmΔQ×(E,F)>α(q1) \min\{|E|,|F| \} \ge C_{m,\alpha}q^m \quad\Longrightarrow\quad |\Delta_Q^\times(E,F)|>\alpha(q-1) for all E,F\Fq2mE,F\subset \F_q^{2m}. More generally, a qθq^{-\theta}-level version of the Kloosterman input yields the geometric threshold qm+θq^{m+\theta}. In particular, a universal second-moment argument gives an unconditional qm+12q^{m+\frac{1}{2}}-threshold through the same framework. The proof uses positive semidefinite 2×22\times2 Gram matrices on quadratic frequency shells, the shell Fourier transform in even dimension, and a minimax separation argument that produces a uniform signed combination of Kloosterman columns. We also provide evidence for the Kloosterman conjecture and discuss limitations near full support.

Cite

@article{arxiv.2607.05926,
  title  = {Erdős--Falconer distance conjecture from an analytic perspective},
  author = {Le Quang Ham and Dung The Tran},
  journal= {arXiv preprint arXiv:2607.05926},
  year   = {2026}
}