G(m,n) (Dan Dima)

Discuss about this problem

http://domino.research.ibm.com/Comm/wwwr_ponder.nsf/challenges/September2004.html Part 2: Fix K=2. For each N, there is a largest integer M such that we can produce a sequence of vectors W and guarantee that if we apply this sequence in order, we will guarantee that on one of the moves, at least M elements of V are zero. (So we have a more relaxed definition of "winning".) Compute that G(M,N) in the general case. Please send us a simpler description.