Abstract:
Let $X_1,\ldots,X_n$ be independent identically distributed random variables. In this paper we study the behavior of concentration functions of weighted sums $\sum\limits_{k=1}^{n}X_ka_k $ with respect to the arithmetic structure of coefficients $a_k$ in the context of the Littlewood–Offord problem. We discuss the relations between the inverse principles proposed by Nguyen, Tao and Vu and similar principles formulated by Arak in his papers from the 1980's. We state some improved (more general and more precise) consequences of Arak's inequalities applying our recent bound in the Littlewood–Offord problem. Moreover, we also obtain an improvement of the estimates used in Rudelson and Vershynin's least common denominator method. \vskip.0cm
Key words and phrases:concentration functions, inequalities, the Littlewood–Offord problem, sums of independent random vectors.