Hypercontractive inequalities via SOS, and the Frankl--Rödl graph

preprint2016arXivOpen access

Abstract

Our main result is a formulation and proof of the reverse hypercontractive inequality in the sum-of-squares (SOS) proof system. As a consequence we show that for any constant 0<γ≤1/40 < γ\leq 1/4, the SOS/Lasserre SDP hierarchy at degree 4⌈14γ⌉4\lceil \frac{1}{4γ}\rceil certifies the statement "the maximum independent set in the Frankl--Rödl graph FRγn\mathrm{FR}^{n}_γ has fractional size~o(1)o(1)". Here FRγn=(V,E)\mathrm{FR}^{n}_γ = (V,E) is the graph with V={0,1}nV = \{0,1\}^n and (x,y)∈E(x,y) \in E whenever Δ(x,y)=(1−γ)nΔ(x,y) = (1-γ)n (an even integer). In particular, we show the degree-44 SOS algorithm certifies the chromatic number lower bound "χ(FR1/4n)=ω(1)χ(\mathrm{FR}^{n}_{1/4}) = ω(1)", even though FR1/4n\mathrm{FR}^{n}_{1/4} is the canonical integrality gap instance for which standard SDP relaxations cannot even certify "χ(FR1/4n)>3χ(\mathrm{FR}^{n}_{1/4}) > 3". Finally, we also give an SOS proof of (a generalization of) the sharp (2,q)(2,q)-hypercontractive inequality for any even integer qq.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.