Colorful Vector Balancing

From MaRDI portal





Abstract: We extend classical estimates for the vector balancing constant of mathbbRd equipped with the Euclidean and the maximum norms proved in the 1980's by showing that for p=2 and p=infty, given vector families V1,ldots,VnsubsetBpd with 0insumi=1nmathrmconv,Vi, one may select vectors viinVi with [ | v_1 + ldots + v_n |_2 leq sqrt{d} ] for p=2, and [ | v_1 + ldots + v_n |_infty leq O(sqrt{d}) ] for p=infty. These bounds are sharp and asymptotically sharp, respectively, for ngeqd, and they significantly strengthen the estimate of B'ar'any and Grinberg for general norms on mathbbRd. The proofs combine linear algebraic and probabilistic methods with a Gaussian random walk argument.












This page was built for publication: Colorful Vector Balancing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6427194)