Tomaszewski's problem on randomly signed sums, revisited (Q2030761)

Summary: Let \(v_1,v_2,\ldots, v_n\) be real numbers whose squares add up to 1. Consider the \(2^n\) signed sums of the form \(S = \sum \pm v_i\). The first author and \textit{R. Holzman} [Electron. J. Comb. 24, No. 3, Research Paper P3.40, 10 p. (2017; Zbl 1381.60025)] proved that at least 13/32 of these sums satisfy \(|S| \leqslant 1\). Here we improve their bound to \(0.427685\).