Huang's theorem and the exterior algebra
Abstract
In this note we give a version of Hao Huang's proof of the sensitivity conjecture, shedding some light on the origin of the magical matrix A in that proof. For the history of the subject and the importance of this conjecture to the study of boolean functions, we refer to the original paper. Here we only state the main result: Consider the boolean cube Qn=\0,1\n as a graph, whose edges connect pairs of vertices differing in one coordinate. Then any its induced subgraph on greater than 2n-1 (the half) vertices has degree of some vertex at least n.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.