Resilience for the Littlewood-Offord problem

DOI10.1016/j.aim.2017.08.031zbMath1427.60016OpenAlexW2754975617MaRDI QIDQ5920087

Afonso S. Bandeira, Asaf Ferber, Matthew Kwan

Publication date: 19 September 2017

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aim.2017.08.031

zbMATH Keywords

resilienceanti-concentrationLittlewood-Offord

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Related Items

A non-uniform Littlewood-Offord inequality ⋮ A nonuniform Littlewood-Offord inequality for all norms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal inverse Littlewood-Offord theorems
• Random symmetric matrices are almost surely nonsingular.
• The concentration of the chromatic number of random graphs
• Sphere coverings of the hypercube with incomparable centers
• Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
• A sharp inverse Littlewood-Offord theorem
• Local resilience of graphs
• 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
• Über ein Problem von Erdös und Moser
• On a lemma of Littlewood and Offord