This is fun: Huang's account of how he found the proof: https://www.scottaaronson.com/blog/?p=4229#comment-1813116 … (via HN)
Show this thread
Don Knuth's 1-page simplified proof of the (recently-proved, 30 year old) Sensitivity Conjecture for Boolean functions: https://www.cs.stanford.edu/~knuth/papers/huang.pdf …
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Nice that he compiled the pdf for us, instead of raw tex
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Ah, but that colon before the "Theorem" violates one of his main recommendations from his class on math writing. The letter Z does not approve.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Very nice! A few points confused me at first: 1. Rank B_n = 2^{n-1} doesn't seem important for anything that follows 2. I see no reason to choose x to be a unit vector, and 3. The indices on the LHS of the inequality expression are off (y_n should be y_\alpha I think).
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.