Slicing a Cube in N Dimensions


Girish Varma Tata Institute of Fundamental Research School of Technology and Computer Science Homi Bhabha Road <br


Tuesday, 29 March 2011 (All day)


  • A-212 (STCS Seminar Room)

We will consider the problem of cutting the maximum number of edges of a cube (commonly known as hypercube in n-dimensions) using a plane (hyperplane in n-dimensions). We will see an explicit plane which gives the maximum cut. Also, we will use a combinatorial lemma (a generalization of Sperner's Lemma) to prove this theorem about geometry.