Tag Archives: Hao Huang

Covering the binary hypercube

A finite grid is a set , where is a field and each is a finite subset of . The minimum number of hyperplanes required to cover can easily be shown to be , with the hyperplanes defined by , … Continue reading

Posted in Combinatorics, Extremal Combinatorics, Finite Geometry, Polynomial Method | Tagged , , , , , , , , , , | 1 Comment

Spectral proofs of theorems on the boolean hypercube

In a recent breakthrough Hao Huang proved the sensitivity conjecture, that had remained open for past 30 years despite some serious effort from various computer scientists and mathematicians. The proof can be described in a single tweet (if you have … Continue reading

Posted in Combinatorics, Extremal Combinatorics, Spectral Graph Theory | Tagged , , , , , , , | 5 Comments