Improved bound for Tomaszewski's problem

Abstract: In 1986, Tomaszewski made the following conjecture. Given

n

real numbers

a_{1}, ..., a_{n}

with

s u m_{i = 1}^{n} a_{i}^{2} = 1

, then of the

2^{n}

signed sums

p m a_{1} p m ... p m a_{n}

, at least half have absolute value at most

1

. Hendriks and Van Zuijlen (2020) and Boppana (2020) independently proved that a proportion of at least

0.4276

of these sums has absolute value at most

1

. Using different techniques, we improve this bound to

0.46

.

Recommendations

Cites Work

Cited In (4)

This page was built for publication: Improved bound for Tomaszewski's problem