On 16 September 2019 I gave a talk in the Monash discrete mathematics seminar.
The sensitivity conjecture, induced subgraphs of cubes, and Clifford algebras
Recently, Hao Huang gave an ingenious short proof of a longstanding conjecture in computer science, the Sensitivity Conjecture, about the complexity of boolean functions. Huang proved this conjecture by establishing a result about the maximal degree of induced subgraphs of cube graphs. In recent work, we gave a new version of this result, and slightly generalise it, by connecting it to the theory of Clifford Algebras, algebraic structures which arise all across mathematics.