A sharp inverse Littlewood-Offord theorem
Combinatorics
2009-10-20 v2
Abstract
Let be iid Bernoulli random variables. Given a multiset of numbers , the \emph{concentration probability} of is defined as . A classical result of Littlewood-Offord and Erd\H os from the 1940s asserts that if the are non-zero, then this probability is at most . Since then, many researchers obtained better bounds by assuming various restrictions on . In this paper, we give an asymptotically optimal characterization for all multisets having large concentration probability. This allow us to strengthen or recover several previous results in a straightforward manner.
Cite
@article{arxiv.0902.2357,
title = {A sharp inverse Littlewood-Offord theorem},
author = {Terence Tao and Van Vu},
journal= {arXiv preprint arXiv:0902.2357},
year = {2009}
}
Comments
17 pages, no figures, to appear, Random Structures and Algorithms. This is the final version, incorporating the referee's corrections and suggestions