<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1907.00847/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1907.00847/feed.xml" rel="self" type="application/rss+xml" /><item><title>Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture — mentioned by amirhirsch</title><link>https://news.ycombinator.com/item?id=28758156</link><guid isPermaLink="false">urn:hackerpapers:mention:1907.00847:28758156</guid><pubDate>Tue, 05 Oct 2021 11:55:19 GMT</pubDate><description>&lt;p&gt;For those who want a real deep dive, I recommend this video course on Analysis of Boolean Functions from Ryan O&amp;#x27;Donnell: https://www.youtube.com/watch?v=JIruJ8edYYM https://www.cs.cmu.edu/~odonnell/boolean-analysis/ And his book: http://www.cs.tau.ac.il/~amnon/Classes/2016-PRG/Analysis-Of-... Some recent progress in the field includes the amazingly simple proof of the Sensitivity Theorem by Hao Huang: https://arxiv.org/abs/1907.00847 Here&amp;#x27;s Knuth&amp;#x27;s one-page proof: https://www.cs.stanford.edu/~knuth/papers/huang.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1907.00847/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.CO</category></item><item><title>Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture — HN submission</title><link>https://news.ycombinator.com/item?id=24339687</link><guid isPermaLink="false">urn:hackerpapers:submission:1907.00847:24339687</guid><pubDate>Tue, 01 Sep 2020 08:38:54 GMT</pubDate><description>&lt;p&gt;Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1907.00847/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>math.CO</category></item><item><title>Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture — HN submission</title><link>https://news.ycombinator.com/item?id=20631673</link><guid isPermaLink="false">urn:hackerpapers:submission:1907.00847:20631673</guid><pubDate>Wed, 07 Aug 2019 03:01:12 GMT</pubDate><description>&lt;p&gt;Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1907.00847/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>math.CO</category></item><item><title>Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture — HN submission</title><link>https://news.ycombinator.com/item?id=20619458</link><guid isPermaLink="false">urn:hackerpapers:submission:1907.00847:20619458</guid><pubDate>Mon, 05 Aug 2019 21:54:16 GMT</pubDate><description>&lt;p&gt;Sensitivity Conjecture Proof&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1907.00847/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>math.CO</category></item><item><title>Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture — mentioned by plg</title><link>https://news.ycombinator.com/item?id=20536175</link><guid isPermaLink="false">urn:hackerpapers:mention:1907.00847:20536175</guid><pubDate>Fri, 26 Jul 2019 16:50:16 GMT</pubDate><description>&lt;p&gt;nice use of a single .tex file to produce the full .pdf https://arxiv.org/e-print/1907.00847 (rename to 1907.00847.tex and then latexmk -pdf 1907.00847.tex)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1907.00847/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.CO</category></item><item><title>Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture — mentioned by floatingatoll</title><link>https://news.ycombinator.com/item?id=20532148</link><guid isPermaLink="false">urn:hackerpapers:mention:1907.00847:20532148</guid><pubDate>Fri, 26 Jul 2019 03:31:49 GMT</pubDate><description>&lt;p&gt;On boolean sensitivies: https://d2r55xnwy6nx47.cloudfront.net/uploads/2019/07/Boolea... The closing quote: &amp;gt; [Huang] was able to prove that in any collection of more than half the points in an n-dimensional cube, there will be some point that is connected to at least √n of the other points — and the sensitivity conjecture instantly followed from this result The actual paper: https://arxiv.org/abs/1907.00847 Another blog post: https://www.scottaaronson.com/blog/?p=4229 An older HN post: https://news.ycombinator.com/item?id=20338281&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1907.00847/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.CO</category></item></channel></rss>
