Department of Mathematics and Statistics

Department of Mathematics and Statistics
Department of Mathematics and Statistics

Math Club


Thursday, January 23rd, 2020

Time: 5:30 - 6:30 p.m Place: Jeffery Hall 319

Speaker: Ivan Dimitrov (Queen's University)

Title: Proof of the Sensitivity Conjecture.

Abstract:  Last year Hao Huang proved that, if $P$ is a set of $2^{n-1} +1$ vertices of an n-dimensional cube, it contains a vertex with at least $\sqrt{n}$ neighbours in $P$. This settled the nearly 30-year old Sensitivity Conjecture. I will present Huang’s proof and show that the estimate $\sqrt{n}$ is sharp.