The sensitivity conjecture, induced subgraphs of cubes, and Clifford algebras
Combinatorics
2019-09-04 v2 Rings and Algebras
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.
Keywords
Cite
@article{arxiv.1907.12357,
title = {The sensitivity conjecture, induced subgraphs of cubes, and Clifford algebras},
author = {Daniel V. Mathews},
journal= {arXiv preprint arXiv:1907.12357},
year = {2019}
}
Comments
4 pages. v2: Updated to acknowledge independent observations of Mrowka