Proof of Tomaszewski's conjecture on randomly signed sums

Nathan Keller, Ohad Klein

Research output: Contribution to journalArticlepeer-review

Abstract

We prove the following conjecture, due to Tomaszewski (1986): Let X=∑i=1naixi, where ∑iai2=1 and each xi is a uniformly random sign. Then Pr⁡[|X|≤1]≥1/2. Our main novel tools are local concentration inequalities and an improved Berry-Esseen inequality for Rademacher sums.

Original languageEnglish
Article number108558
JournalAdvances in Mathematics
Volume407
DOIs
StatePublished - 8 Oct 2022

Keywords

  • Analysis of Boolean functions
  • Combinatorics
  • Probabilistic inequalities
  • Tail inequalities

All Science Journal Classification (ASJC) codes

  • General Mathematics

Fingerprint

Dive into the research topics of 'Proof of Tomaszewski's conjecture on randomly signed sums'. Together they form a unique fingerprint.

Cite this