Colorful vector balancing

Abstract

We extend classical estimates for the vector balancing constant of equipped with the Euclidean and the maximum norms proved in the 1980s by showing that for and , given vector families with , one may select vectors with for , and for . These bounds are sharp and asymptotically sharp, respectively, for . The proofs combine linear algebraic and probabilistic methods with a Gaussian random walk argument.