27 Jun
2012
27 Jun
'12
4:57 p.m.
Warren brings up the very interesting question: For any such "0-modification" of the set {-1,1}^n (i.e., so that some components of some vectors become 0, the rest remaining unchanged), what is the smallest number f(n) such that there is always a nonempty subset S of modified vectors summing to the 0 vector, with #(S) <= f(n) ??? --Dan ________________________________________________________________________________________ It goes without saying that .