Covering the cube by affine hyperplanes (Q1209723): Difference between revisions

Let \(V=\{1,-1\}^ n\) be the vertex set of an \(n\)-cube. The authors solve the following problem: What is the minimum number, \(m(n)\), of hyperplanes covering exactly \(2^ n-1\) vertices of the \(n\)-cube? Their first result is an exact determination of \(m(n)\) (which turns out to be \(n)\). They also establish a number of extensions of that result. Their proofs apply linear algebra techniques. In order to exhibit the variety of proof methods the authors try to apply a slightly different method in the proof of each extension.