Hypercontractive inequalities via SOS, and the Frankl--R\"odl graph

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/4, the SOS/Lasserre SDP hierarchy at degree 4 14γ certifies the statement "the maximum independent set in the Frankl--R\"odl graph FRnγ has fractional size~o(1)". Here FRnγ = (V,E) is the graph with V = \0,1\n and (x,y) ∈ E whenever (x,y) = (1-γ)n (an even integer). In particular, we show the degree-4 SOS algorithm certifies the chromatic number lower bound "(FRn1/4) = ω(1)", even though FRn1/4 is the canonical integrality gap instance for which standard SDP relaxations cannot even certify "(FRn1/4) > 3". Finally, we also give an SOS proof of (a generalization of) the sharp (2,q)-hypercontractive inequality for any even integer q.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…