Balanced partitions of vector sequences (Q2369044)

Let \(d,r\in {\mathbb N}\) and \(\| {\cdot}\| \) be any norm on~\({\mathbb R}^d\). Let \(B\) denote the unit ball with respect to this norm. It is shown that any sequence \(v_1,v_2,\dots\) of vectors in~\(B\) can be partitioned into \(r\) subsequences \(V_1,\dots, V_r\) in a balanced manner with respect to the partial sums: For all \(n\in {\mathbb N}\), \(\ell\leqslant r\), we have \(\| \sum_{i\leqslant k,\;v_i\in V_\ell} v_i-\frac 1r\sum _{i\leqslant k} v_i\| \leqslant 2.005d\). A~similar bound holds for partitioning sequences of vector sets. Both result extend an earlier one of \textit{I. Bárány} and \textit{V. S. Grinberg} [Linear Algebra Appl. 41, 1--9 (1981; Zbl 0467.90079)] to partitions in arbitrary many classes. It is worth mentioning that the results hold for all norms in~\({\mathbb R}^d\).