A nonuniform Littlewood-Offord inequality for all norms
From MaRDI portal
Publication:2022155
Abstract: Let be vectors in and be independent Rademacher random variables. Then the Littlewood-Offord problem entails finding the best upper bound for . Generalizing the uniform bounds of Littlewood-Offord, ErdH{o}s and Kleitman, a recent result of Dzindzalieta and Juv{s}keviv{c}ius provides a non-uniform bound that is optimal in its dependence on . In this short note, we provide a simple alternative proof of their result. Furthermore, our proof demonstrates that the bound applies to any norm on , not just the norm. This resolves a conjecture of Dzindzalieta and Juv{s}keviv{c}ius.
Recommendations
Cites work
- A Combinatorial Theorem on Systems of Sets
- A non-uniform Littlewood-Offord inequality
- Estimates for the concentration function of combinatorial number theory and probability
- scientific article; zbMATH DE number 3099315 (Why is no real title available?)
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- Non-abelian Littlewood-Offord inequalities
- On a combinatorial conjecture of Erdös
- On a lemma of Littlewood and Offord
- Optimal inverse Littlewood-Offord theorems
- Resilience for the Littlewood-Offord problem
- Singularity of random Bernoulli matrices
- The Littlewood-Offord problem and invertibility of random matrices
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
Cited in
(6)- The Littlewood-Offord problem for Markov chains
- A non-uniform Littlewood-Offord inequality
- The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi
- Non-abelian Littlewood-Offord inequalities
- Inverse Littlewood-Offord problems for quasi-norms
- Improved Berry-Esseen bound for Rademacher sum
This page was built for publication: A nonuniform Littlewood-Offord inequality for all norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2022155)