Kloosterman anti-concentration conjecture
Kloosterman anti-concentration conjecture
Let be an odd prime power, let be the character used to define the classical Kloosterman sum
and, for a nonempty set , let
Kloosterman anti-concentration conjecture. For every , there exists a constant such that, for every odd prime power , if satisfies
then every probability measure satisfies
The conjecture is the analytic input for the paper's semidefinite approach to the two-set Erdős–Falconer distance problem. The paper reports constant-scale evidence for some measures and structured supports, while proving unconditional bounds at the scale in general and at the scale when ; the constant-scale assertion remains open.
Sources & referencesView supporting material
Primary source
Le Quang Ham and Dung The Tran, “Erdős–Falconer distance conjecture from an analytic perspective”, arXiv:2607.05926 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.