Sensitivity conjecture and signed hypercubes - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

Sensitivity conjecture and signed hypercubes

Résumé

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 earlier work, this completed a proof of the sensitivity conjecture. In this work we show how to derive Huang's result using linear dependency and independence of vectors associated with the vertices of the hypercube. Our approach leads to several improvements of Huang's 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 0 (f)s 1 (f), a strictly stronger statement which implies the sensitivity conjecture. Using these linear dependencies, we show structural relations about the neighborhoods on the induced subgraph at distance at most three. A key implement in Huang's proof is to assign signs (+, −) to the edges of H n such that the product of the signs on each 4-cycle is −. With the set of negative edges being called a signature, one may observe that there are a total of 2 2 n −1 such signatures on H n satisfying this condition and that the symmetric difference of any two such signatures is an edge cut. A question of high interest then is to find the smallest size among all these signatures. This is known as the frustration index in the study of signed graphs. Here we provide lower and upper bounds for this parameter, observing that the two bounds match when n is a power of 4. We then establish a strong connection with other studies: On the one hand with a question of Erdős on the number of edges of the largest 4-cycle free subgraph of the hypercube. On the other hand with Ambainis functions which are used to show a separation between degree and adversary lower bounds on query complexity.
Fichier principal
Vignette du fichier
SensitivityConj-SignedHypercube_SubmitedTOCTMarch2023.pdf (534.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04080411 , version 1 (24-04-2023)

Identifiants

  • HAL Id : hal-04080411 , version 1

Citer

Sophie Laplante, Reza Naserasr, Anupa Sunny, Zhouningxin Wang. Sensitivity conjecture and signed hypercubes. 2023. ⟨hal-04080411⟩
66 Consultations
49 Téléchargements

Partager

Gmail Facebook X LinkedIn More