English

Improved Bound for Tomaszewski's Problem

Combinatorics 2021-03-02 v1 Probability

Abstract

In 1986, Tomaszewski made the following conjecture. Given nn real numbers a1,...,ana_{1},...,a_{n} with i=1nai2=1\sum_{i=1}^{n}a_{i}^{2}=1, then of the 2n2^{n} signed sums ±a1±...±an\pm a_{1} \pm ... \pm a_{n}, at least half have absolute value at most 11. Hendriks and Van Zuijlen (2020) and Boppana (2020) independently proved that a proportion of at least 0.42760.4276 of these sums has absolute value at most 11. Using different techniques, we improve this bound to 0.460.46.

Keywords

Cite

@article{arxiv.2005.05031,
  title  = {Improved Bound for Tomaszewski's Problem},
  author = {Vojtěch Dvořák and Peter van Hintum and Marius Tiba},
  journal= {arXiv preprint arXiv:2005.05031},
  year   = {2021}
}

Comments

12 pages

R2 v1 2026-06-23T15:27:12.115Z