Girish Varma
Tata Institute of Fundamental Research
School of Technology and Computer Science
Homi Bhabha Road
Date:
Tuesday, 29 Mar 2011 (all day)
Venue:
A-212 (STCS Seminar Room)
(Scan to add to calendar)
Abstract:
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.