The optimal point-concentration bound for definable sets

About 5 years old · traced to

Let S⊆RdS\subseteq\mathbb{R}^d be a set definable in an o-minimal structure and containing no line segment. For nonzero vectors a1,…,an∈Rda_1,\dots,a_n\in\mathbb{R}^d, let ξ1,…,ξn\xi_1,\dots,\xi_n be i.i.d. Rademacher random variables and set

X=a1ξ1+⋯+anξn.X=a_1\xi_1+\dots+a_n\xi_n.

Optimal point-concentration conjecture. In the setting of Theorem baby-forwards, one has Pr⁡(X∈S)≤CS/n\Pr(X\in S)\le C_S/\sqrt n for some constant CSC_S depending only on SS.

The preceding theorem proves the weaker bound n−1/2+αn^{-1/2+\alpha} for every α>0\alpha>0 when nn is sufficiently large. The conjecture asks for the optimal Erdős--Littlewood--Offord order of magnitude in this o-minimal setting.

References

Primary source

Jacob Fox, Matthew Kwan and Hunter Spink, “Geometric and o-minimal Littlewood-Offord problems”, arXiv:2106.04894 (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.