TCS+ Talk

Tuesday October 22, 2019 10:00 AM

A proof of the Sensitivity Conjecture

Speaker: Hao Huang, Emory University
Location: Annenberg 322

Abstract: In the n-dimensional hypercube graph, one can easily choose half of the vertices such that they induce an empty graph. However, having even just one more vertex would cause the induced subgraph to contain a vertex of degree at least \sqrt{n}. This result is best possible, and improves a logarithmic lower bound shown by Chung, Furedi, Graham and Seymour in 1988. In this talk we will discuss a very short algebraic proof of it.

As a direct corollary of this purely combinatorial result, the sensitivity and degree of every boolean function are polynomially related. This solves an outstanding foundational problem in theoretical computer science, the Sensitivity Conjecture of Nisan and Szegedy.

Series TCS+ Talks

Contact: Bonnie Leung bjleung@caltech.edu