Vector balancing in Lebesgue spaces

From MaRDI portal
Publication:6074880



Abstract: A tantalizing conjecture in discrete mathematics is the one of Koml'os, suggesting that for any vectors mathbfa1,ldots,mathbfaninB2m there exist signs x1,dots,xnin−1,1 so that |sumi=1nximathbfai|inftyleO(1). It is a natural extension to ask what ellq-norm bound to expect for mathbfa1,ldots,mathbfaninBpm. We prove that, for 2lepleqleinfty, such vectors admit fractional colorings x1,dots,xnin[−1,1] with a linear number of pm1 coordinates so that |sumi=1nximathbfai|qleqO(sqrtmin(p,log(2m/n)))cdotn1/2−1/p+1/q, and that one can obtain a full coloring at the expense of another factor of frac11/2−1/p+1/q. In particular, for pin(2,3] we can indeed find signs mathbfxin−1,1n with |sumi=1nximathbfai|inftyleO(n1/2−1/pcdotfrac1p−2). Our result generalizes Spencer's theorem, for which p=q=infty, and is tight for m=n. Additionally, we prove that for any fixed constant delta>0, in a centrally symmetric body KsubseteqmathbbRn with measure at least e−deltan one can find such a fractional coloring in polynomial time. Previously this was known only for a small enough constant -- indeed in this regime classical nonconstructive arguments do not apply and partial colorings of the form mathbfxin−1,0,1n do not necessarily exist.












This page was built for publication: Vector balancing in Lebesgue spaces

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