A sharp inverse Littlewood-Offord theorem

Details A sharp inverse Littlewood-Offord theorem A sharp inverse Littlewood-Offord theorem

2009-02-13

arxiv.org/abs/0902.2357v2

Mathematics

Combinatorics

17 pages, no figures, to appear, Random Structures and Algorithms. This is the final version, incorporating the referee's corr

Scientific paper

Let $\eta_i, i=1,..., n$ be iid Bernoulli random variables. Given a multiset $\bv$ of $n$ numbers $v_1, ..., v_n$, the \emph{concentration probability} $\P_1(\bv)$ of $\bv$ is defined as $\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 $v_i $ are non-zero, then this probability is at most $O(n^{-1/2})$. Since then, many researchers obtained better bounds by assuming various restrictions on $\bv$. In this paper, we give an asymptotically optimal characterization for all multisets $\bv$ having large concentration probability. This allow us to strengthen or recover several previous results in a straightforward manner.

Affiliated with

Also associated with

No associations

Rating

A sharp inverse Littlewood-Offord theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A sharp inverse Littlewood-Offord theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A sharp inverse Littlewood-Offord theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-357855