hyperplane covering
Source: miklos schweitzer 2011 q3
August 29, 2021
algebraic combinatoricsEuclidean spacereal analysis
Problem Statement
In , all points of an n × n × ··· × n cube grid are contained in 2n - 3 hyperplanes. Prove that n () hyperplanes can be chosen from these so that they contain all points of the grid.