English

A nonuniform Littlewood-Offord inequality for all norms

Combinatorics 2020-09-03 v2

Abstract

Let vi\mathbf{v}_i be vectors in Rd\mathbb{R}^d and {εi}\{\varepsilon_i\} be independent Rademacher random variables. Then the Littlewood-Offord problem entails finding the best upper bound for supxRdP(εivi=x)\sup_{\mathbf{x} \in \mathbb{R}^d} \mathbb{P}(\sum \varepsilon_i \mathbf{v}_i = \mathbf{x}). Generalizing the uniform bounds of Littlewood-Offord, Erd\H{o}s and Kleitman, a recent result of Dzindzalieta and Ju\v{s}kevi\v{c}ius provides a non-uniform bound that is optimal in its dependence on x2\|\mathbf{x}\|_2. In this short note, we provide a simple alternative proof of their result. Furthermore, our proof demonstrates that the bound applies to any norm on Rd\mathbb{R}^d, not just the 2\ell_2 norm. This resolves a conjecture of Dzindzalieta and Ju\v{s}kevi\v{c}ius.

Keywords

Cite

@article{arxiv.2008.12341,
  title  = {A nonuniform Littlewood-Offord inequality for all norms},
  author = {Kyle Luh and David Xiang},
  journal= {arXiv preprint arXiv:2008.12341},
  year   = {2020}
}

Comments

5 pages, corrected error in the proof of Theorem 1.4