Resilience for the Littlewood-Offord problem
From MaRDI portal
Publication:5915806
DOI10.1016/j.endm.2017.06.025zbMath1400.60010arXiv1609.08136OpenAlexW2964109235MaRDI QIDQ5915806
Asaf Ferber, Matthew Kwan, Afonso S. Bandeira
Publication date: 18 January 2018
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.08136
Cites Work
- Optimal inverse Littlewood-Offord theorems
- Random symmetric matrices are almost surely nonsingular.
- The concentration of the chromatic number of random graphs
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item