Sensitivity Lower Bounds from Linear Dependencies
Uloženo v:
| Název: | Sensitivity Lower Bounds from Linear Dependencies |
|---|---|
| Autoři: | Laplante, Sophie, Naserasr, Reza, Sunny, Anupa |
| Přispěvatelé: | Sophie Laplante and Reza Naserasr and Anupa Sunny, Javier Esparza, Daniel Kráľ |
| Informace o vydavateli: | Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020. |
| Rok vydání: | 2020 |
| Témata: | Sensitivity, Polynomial Degree, Boolean Functions, ddc:004, Theory of computation → Computational complexity and cryptography |
| Popis: | Recently, using spectral techniques, H. Huang proved that every subgraph of the hypercube of dimension n induced on more than half the vertices has maximum degree at least √n. Combined with some earlier work, this completed a proof of the sensitivity conjecture. In this work we show how to derive a proof of Huang’s result using only linear dependency and independence of vectors associated with the vertices of the hypercube. Our approach leads to several improvements of the result. In particular we prove that in any induced subgraph of H_n with more than half the number of vertices, there are two vertices, one of odd parity and the other of even parity, each with at least n vertices at distance at most 2. As an application we show that for any Boolean function f, the polynomial degree of f is bounded above by s₀(f) s₁(f), a strictly stronger statement which implies the sensitivity conjecture. |
| Druh dokumentu: | Conference object Article |
| Popis souboru: | application/pdf |
| Jazyk: | English |
| DOI: | 10.4230/lipics.mfcs.2020.62 |
| Přístupová URL adresa: | https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.62 |
| Rights: | CC BY |
| Přístupové číslo: | edsair.dedup.wf.002..7dba51c34957e538db4c049d4fb65be1 |
| Databáze: | OpenAIRE |
Nájsť tento článok vo Web of Science | Abstrakt: | Recently, using spectral techniques, H. Huang proved that every subgraph of the hypercube of dimension n induced on more than half the vertices has maximum degree at least √n. Combined with some earlier work, this completed a proof of the sensitivity conjecture. In this work we show how to derive a proof of Huang’s result using only linear dependency and independence of vectors associated with the vertices of the hypercube. Our approach leads to several improvements of the result. In particular we prove that in any induced subgraph of H_n with more than half the number of vertices, there are two vertices, one of odd parity and the other of even parity, each with at least n vertices at distance at most 2. As an application we show that for any Boolean function f, the polynomial degree of f is bounded above by s₀(f) s₁(f), a strictly stronger statement which implies the sensitivity conjecture. |
|---|---|
| DOI: | 10.4230/lipics.mfcs.2020.62 |