On 31 July 2019 I gave at talk at Monash University in the topology seminar.

Title:

The sensitivity conjecture, induced subgraphs of cubes, and Clifford algebras

Abstract:

Recently, Hao Huang gave an ingenious short proof of a longstanding conjecture in computer science, the Sensitivity Conjecture. Huang proved this conjecture by establishing a result about the maximal degree of induced subgraphs of cube graphs. In very 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 naturally in geometry, topology and physics.

Monash topology talk on sensitivity conjecture and Clifford algebras, July 2019