English

Geometric and o-minimal Littlewood-Offord problems

Combinatorics 2022-06-16 v2 Logic

Abstract

The classical Erd\H{o}s-Littlewood-Offord theorem says that for nonzero vectors a1,,anRda_1,\dots,a_n\in \mathbb{R}^d, any xRdx\in \mathbb{R}^d, and uniformly random (ξ1,,ξn){1,1}n(\xi_1,\dots,\xi_n)\in\{-1,1\}^n, we have Pr(a1ξ1++anξn=x)=O(n1/2)\Pr(a_1\xi_1+\dots+a_n\xi_n=x)=O(n^{-1/2}). In this paper we show that Pr(a1ξ1++anξnS)n1/2+o(1)\Pr(a_1\xi_1+\dots+a_n\xi_n\in S)\le n^{-1/2+o(1)} whenever SS is definable with respect to an o-minimal structure (for example, this holds when SS 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.

Keywords

Cite

@article{arxiv.2106.04894,
  title  = {Geometric and o-minimal Littlewood-Offord problems},
  author = {Jacob Fox and Matthew Kwan and Hunter Spink},
  journal= {arXiv preprint arXiv:2106.04894},
  year   = {2022}
}

Comments

22 pages, minor edits. To appear in the Annals of Probability