Proof of Tomaszewski's Conjecture on Randomly Signed Sums
Preprint
Abstract
We prove the following conjecture, due to Tomaszewski (1986): Let $X= \sum_{i=1}^{n} a_{i} x_{i}$, where $\sum_i a_i^2=1$ and each $x_i$ is a uniformly random sign. Then $\Pr[|X|\leq 1] \geq 1/2$. Our main novel tools are local concentration inequalities and an improved Berry-Esseen inequality for Rademacher sums.
Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Probability Mass of Rademacher Sums Beyond One Standard DeviationSIAM Journal on Discrete Mathematics, 2022
- Improved Bound for Tomaszewski's ProblemSIAM Journal on Discrete Mathematics, 2020
- On the volume of non-central sections of a cubeAdvances in Mathematics, 2020
- On normal approximations to symmetric hypergeometric lawsTransactions of the American Mathematical Society, 2017
- A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional GeometrySIAM Journal on Discrete Mathematics, 2016
- A note on random signs∗Lithuanian Mathematical Journal, 2014
- Uniform rates of convergence in the CLT for quadratic forms in multidimensional spacesProbability Theory and Related Fields, 1997
- On the product of sign vectors and unit vectorsCombinatorica, 1992
- Limits for a distribution, if the characteristic function is given in a finite domainScandinavian Actuarial Journal, 1972
- A moment inequality with an application to the central limit theoremScandinavian Actuarial Journal, 1956