English

Arak Inequalities for Concentration Functions and the Littlewood--Offord Problem: a shortened version

Probability 2022-08-04 v1

Abstract

Let X,X1,,XnX,X_1,\ldots,X_n be independent identically distributed random variables. In this paper we study the behavior of concentration functions of weighted sums k=1nXkak\sum_{k=1}^{n} X_k a_k with respect to the arithmetic structure of coefficients~aka_k in the context of the Littlewood--Offord problem. Concentration results of this type received renewed interest in connection with distributions of singular values of random matrices. Recently, Tao and Vu proposed an Inverse Principle in the Littlewood--Offord problem. We discuss the relations between the Inverse Principle of Tao and Vu as well as that of Nguyen and Vu and a similar principle formulated for sums of arbitrary independent random variables in the work of Arak from the 1980's. This paper is a shortened and edited version of the preprint arXiv:1506.09034. Here we present the results without proofs.

Keywords

Cite

@article{arxiv.1512.02938,
  title  = {Arak Inequalities for Concentration Functions and the Littlewood--Offord Problem: a shortened version},
  author = {Yulia S. Eliseeva and Friedrich Götze and Andrei Yu. Zaitsev},
  journal= {arXiv preprint arXiv:1512.02938},
  year   = {2022}
}

Comments

9 pages. shortened version of arXiv:1506.09034