pith. sign in

arxiv: 1212.5324 · v3 · pith:TFJTD2QLnew · submitted 2012-12-21 · 💻 cs.CC

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

classification 💻 cs.CC
keywords gammamathrmevengraphhypercontractiveproofcertifiesfrankl--r
0
0 comments X
read the original 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 < \gamma \leq 1/4$, the SOS/Lasserre SDP hierarchy at degree $4\lceil \frac{1}{4\gamma}\rceil$ certifies the statement "the maximum independent set in the Frankl--R\"odl graph $\mathrm{FR}^{n}_{\gamma}$ has fractional size~$o(1)$". Here $\mathrm{FR}^{n}_{\gamma} = (V,E)$ is the graph with $V = \{0,1\}^n$ and $(x,y) \in E$ whenever $\Delta(x,y) = (1-\gamma)n$ (an even integer). In particular, we show the degree-$4$ SOS algorithm certifies the chromatic number lower bound "$\chi(\mathrm{FR}^{n}_{1/4}) = \omega(1)$", even though $\mathrm{FR}^{n}_{1/4}$ is the canonical integrality gap instance for which standard SDP relaxations cannot even certify "$\chi(\mathrm{FR}^{n}_{1/4}) > 3$". Finally, we also give an SOS proof of (a generalization of) the sharp $(2,q)$-hypercontractive inequality for any even integer $q$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Triangle-free subsets of the $r$-distance graph of the Hypercube

    math.CO 2025-06 unverdicted novelty 6.0

    Establishes T(n,r) = O(r 2^n / (n+1)) for even r ≤ n/2 in the r-distance hypercube graph together with lower bounds across regimes of r and n.