Abstract. Let X, X 1 , . . . , X n be independent identically distributed random variables. In this paper we study the behavior of concentration functions of weighted sums n k=1 X k a k with respect to the arithmetic structure of coefficients a k in the context of the LittlewoodOfford 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 [8]. Here we present the results without proofs.At the beginning of 1980's, Arak [1, 2] has published new bounds for the concentration functions of sums of independent random variables. These bounds were formulated in terms of the arithmetic structure of supports of distributions of summands. Using these results, he has obtained the final solution of an old problem posed by Kolmogorov [11]. In this paper, we apply Arak's results to the Littlewood-Offord problem which was intensively investigated in the last years. We compare the consequences of Arak's results with recent results of Nguyen, Tao and Vu [13], [14] and [18].Let X, X 1 , . . . , X n be independent identically distributed (i.i.