The Littlewood-Offord problem for Markov chains

Abstract

The celebrated Littlewood-Offord problem asks for an upper bound on the probability that the random variable ε1v1+⋯+εnvn lies in the Euclidean unit ball, where ε1,…,εn∈{−1,1} are independent Rademacher random variables and v1,…,vn∈Rd are fixed vectors of at least unit length. We extend some known results to the case that the εi are obtained from a Markov chain, including the general bounds first shown by Erdős in the scalar case and Kleitman in the vector case, and also under the restriction that the vi are distinct integers due to Sárközy and Szemeredi. In all extensions, the upper bound includes an extra factor depending on the spectral gap and additional dependency on the dimension. We also construct a pseudorandom generator for the Littlewood-Offord problem using similar techniques.

Locations

• arXiv (Cornell University) - View - PDF
• Electronic Communications in Probability - View - PDF