The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi

DOI10.1007/s00493-012-2716-xzbMath1289.05453arXiv1002.5028OpenAlexW1988956155WikidataQ123122306 ScholiaQ123122306MaRDI QIDQ2392038

Terence C. Tao, Van H. Vu

Publication date: 6 August 2013

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

orthonormal basisBernoulli random variablesconcentration inequalitysmall ball probabilityFubini's theoremLittlewood-Offord problem

Mathematics Subject Classification ID

Combinatorial probability (60C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

On the number of Hadamard matrices via anti-concentration, Non-abelian Littlewood-Offord inequalities, Fooling Polytopes, Complex random matrices have no real eigenvalues, Small ball estimates for quasi-norms, Inverse Littlewood-Offord problems for quasi-norms, An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs, Anti-concentration for subgraph counts in random graphs, The Littlewood-Offord problem for Markov chains

Cites Work

• Unnamed Item
• Unnamed Item
• On the tightest packing of sums of vectors
• Stronger form of an M-part Sperner theorem
• A Sperner-type theorem
• Solution of the Littlewood-Offord problem in high dimensions
• Some new results on the Littlewood-Offord problem
• Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
• On a lemma of Littlewood and Offord on the distribution of certain sums
• On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors
• Estimates for the concentration function of combinatorial number theory and probability
• On a lemma of Littlewood and Offord