A non-uniform Littlewood-Offord inequality
Probability
2019-10-23 v1 Combinatorics
Abstract
Consider a sum , where are non-zero vectors in and are independent Rademacher random variables (i.e., ). The classical Littlewood-Offord problem asks for the best possible upper bound for . In this paper we consider a non-uniform version of this problem. Namely, we obtain the optimal bound for in terms of the length of the vector .
Keywords
Cite
@article{arxiv.1910.10041,
title = {A non-uniform Littlewood-Offord inequality},
author = {Dainius Dzindzalieta and Tomas Juškevičius},
journal= {arXiv preprint arXiv:1910.10041},
year = {2019}
}