The optimal point-concentration bound for definable sets
The optimal point-concentration bound for definable sets
Let be a set definable in an o-minimal structure and containing no line segment. For nonzero vectors , let be i.i.d. Rademacher random variables and set
Optimal point-concentration conjecture. In the setting of Theorem baby-forwards, one has for some constant depending only on .
The preceding theorem proves the weaker bound for every when is sufficiently large. The conjecture asks for the optimal Erdős--Littlewood--Offord order of magnitude in this o-minimal setting.
Sources & referencesView supporting material
Primary source
Jacob Fox, Matthew Kwan and Hunter Spink, “Geometric and o-minimal Littlewood-Offord problems”, arXiv:2106.04894 (2022).
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.