Geometric and o-minimal Littlewood-Offord problems
Jacob Fox, Matthew Kwan, Hunter Spink

TL;DR
This paper extends the Littlewood-Offord problem to geometric and o-minimal structures, showing bounds on probabilities for sums of random signs falling into definable sets, with inverse results.
Contribution
It introduces bounds for the probability that a random signed sum lies in o-minimal definable sets, generalizing classical results to geometric and logical structures.
Findings
Probability bound of n^{-1/2+o(1)} for sums in definable sets
Applicable to algebraic hypersurfaces and similar structures
Provides an inverse theorem in the o-minimal setting
Abstract
The classical Erd\H{o}s-Littlewood-Offord theorem says that for nonzero vectors , any , and uniformly random , we have . In this paper we show that whenever is definable with respect to an o-minimal structure (for example, this holds when 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Geometric and Algebraic Topology · Advanced Topology and Set Theory
