2000 character limit reached
On the Littlewood--Offord problem
Published 25 Nov 2014 in math.PR | (1411.6872v1)
Abstract: The paper deals with studying a connection of the Littlewood--Offord problem with estimating the concentration functions of some symmetric infinitely divisible distributions. Some multivariate generalizations of results of Arak (1980) are given. They show a connection of the concentration function of the sum with the arithmetic structure of supports of distributions of independent random vectors for arbitrary distributions of summands.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.