A new approach to an old problem of Erdős and Moser

DOI10.1016/j.jcta.2012.01.003zbMath1268.11019arXiv1112.0755OpenAlexW2079194144MaRDI QIDQ412182

Hoi H. Nguyen

Publication date: 4 May 2012

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

concentration probabilityErdős-Moser problemsharp concentration

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Sums of independent random variables; random walks (60G50) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (2)

Unnamed Item ⋮ Majorization and Rényi entropy inequalities via Sperner theory

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal inverse Littlewood-Offord theorems
• Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
• On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors
• SETS WITH SMALL SUMSET AND RECTIFICATION
• On the singularity probability of random Bernoulli matrices
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• Solution of Two Difficult Combinatorial Problems with Linear Algebra
• Freiman's theorem for solvable groups
• Über ein Problem von Erdös und Moser
• Long arithmetic progressions in sumsets: Thresholds and bounds
• On a lemma of Littlewood and Offord

This page was built for publication: A new approach to an old problem of Erdős and Moser