A non-uniform Littlewood-Offord inequality
Abstract
Consider a sum Sn=vi1+·s+vnn, where (vi)ni=1 are non-zero vectors in Rd and (i)ni=1 are independent Rademacher random variables (i.e., ~P(i= 1)=1/2). The classical Littlewood-Offord problem asks for the best possible upper bound for ~xP(Sn = x). In this paper we consider a non-uniform version of this problem. Namely, we obtain the optimal bound for P(Sn = x) in terms of the length of the vector x∈ Rd.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.