On the Littlewood-Offord problem

DOI10.1007/s10958-016-2790-5zbMath1381.60060arXiv1411.6872OpenAlexW3100474435MaRDI QIDQ292317

Yu. S. Eliseeva, Andrei Yu. Zaitsev

Publication date: 8 June 2016

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.6872

Mathematics Subject Classification ID

Infinitely divisible distributions; stable distributions (60E07) Inequalities; stochastic orderings (60E15)

Related Items (3)

A bound for the maximal probability in the Littlewood-Offord problem ⋮ New applications of Arak's inequalities to the Littlewood-Offord problem ⋮ Arak Inequalities for Concentration Functions and the Littlewood--Offord Problem

Cites Work

• Optimal inverse Littlewood-Offord theorems
• Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
• Bounds on the concentration function in terms of the Diophantine approximation
• The Littlewood-Offord problem and invertibility of random matrices
• Estimates of the Concentration Functions of Weighted Sums of Independent Random Variables
• Smallest singular value of a random rectangular matrix
• Estimates for the concentration function of combinatorial number theory and probability
• From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices
• Invertibility of symmetric random matrices
• Small Ball Probability, Inverse Theorems, and Applications
• On the Kolmogorov-Rogozin inequality for the concentration function
• On the concentration function of a sum of independent random variables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Littlewood-Offord problem