(4 pages) – on the arXiv

Abstract: We give another version of Huang’s proof that an induced subgraph of the n-dimensional cube graph containing over half the vertices has maximal degree at least , which implies the Sensitivity Conjecture. This argument uses Clifford algebras of positive definite signature in a natural way. We also prove a weighted version of the result.

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

Leave a Reply

Your email address will not be published. Required fields are marked *