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

Research output: Contribution to journalArticleResearchpeer-review

1 Citation (Scopus)

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 (Formula Presented), 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.

Original languageEnglish
Pages (from-to)4201-4205
Number of pages5
JournalJournal of the European Mathematical Society
Volume24
Issue number12
DOIs
Publication statusPublished - 2022

Keywords

  • Clifford algebras
  • Sensitivity conjecture

Cite this