License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2020.62
URN: urn:nbn:de:0030-drops-127320
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/12732/
Go to the corresponding LIPIcs Volume Portal

Laplante, Sophie ; Naserasr, Reza ; Sunny, Anupa

Sensitivity Lower Bounds from Linear Dependencies

pdf-format:
LIPIcs-MFCS-2020-62.pdf (0.5 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{laplante_et_al:LIPIcs:2020:12732,
  author =	{Sophie Laplante and Reza Naserasr and Anupa Sunny},
  title =	{{Sensitivity Lower Bounds from Linear Dependencies}},
  booktitle =	{45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)},
  pages =	{62:1--62:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-159-7},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{170},
  editor =	{Javier Esparza and Daniel Kr{\'a}ľ},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12732},
  URN =		{urn:nbn:de:0030-drops-127320},
  doi =		{10.4230/LIPIcs.MFCS.2020.62},
  annote =	{Keywords: Boolean Functions, Polynomial Degree, Sensitivity}
}

Keywords: Boolean Functions, Polynomial Degree, Sensitivity
Collection: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Issue Date: 2020
Date of publication: 18.08.2020

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI