2000 character limit reached
Geometric and o-minimal Littlewood-Offord problems
Published 9 Jun 2021 in math.CO and math.LO | (2106.04894v2)
Abstract: The classical Erd\H{o}s-Littlewood-Offord theorem says that for nonzero vectors $a_1,\dots,a_n\in \mathbb{R}d$, any $x\in \mathbb{R}d$, and uniformly random $(\xi_1,\dots,\xi_n)\in{-1,1}n$, we have $\Pr(a_1\xi_1+\dots+a_n\xi_n=x)=O(n{-1/2})$. In this paper we show that $\Pr(a_1\xi_1+\dots+a_n\xi_n\in S)\le n{-1/2+o(1)}$ whenever $S$ is definable with respect to an o-minimal structure (for example, this holds when $S$ is any algebraic hypersurface), under the necessary condition that it does not contain a line segment. We also obtain an inverse theorem in this setting.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.