English

A sharp inverse Littlewood-Offord theorem

Combinatorics 2009-10-20 v2

Abstract

Let ηi,i=1,...,n\eta_i, i=1,..., n be iid Bernoulli random variables. Given a multiset \bv\bv of nn numbers v1,...,vnv_1, ..., v_n, the \emph{concentration probability} 1(\bv)\P_1(\bv) of \bv\bv is defined as 1(\bv):=supx(v1η1+...vnηn=x)\P_1(\bv) := \sup_{x} \P(v_1 \eta_1+ ... v_n \eta_n=x). A classical result of Littlewood-Offord and Erd\H os from the 1940s asserts that if the viv_i are non-zero, then this probability is at most O(n1/2)O(n^{-1/2}). Since then, many researchers obtained better bounds by assuming various restrictions on \bv\bv. In this paper, we give an asymptotically optimal characterization for all multisets \bv\bv having large concentration probability. This allow us to strengthen or recover several previous results in a straightforward manner.

Keywords

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

R2 v1 2026-06-21T12:11:22.401Z