Proof of Tomaszewski's conjecture on randomly signed sums

Nathan Keller, Ohad Klein

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

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

Bibliographical note

Publisher Copyright:
© 2022 Elsevier Inc.

Funding

Research supported by the Israel Science Foundation (grants no. 1612/17 and 2669/21) and by the U.S-Israel Binational Science Foundation (grant no. 2014290).

FundersFunder number
United States-Israel Binational Science Foundation2014290
Israel Science Foundation2669/21, 1612/17

    Keywords

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

    Fingerprint

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

    Cite this