A degree 4 sum-of-squares lower bound for the clique number of the Paley graph
Dmitriy Kunisky, Xifan Yu

TL;DR
This paper establishes a degree 4 sum-of-squares lower bound of at least (p^{1/3}) for the clique number of Paley graphs, contrasting with the conjecture that the clique number is polylogarithmic, and explores implications for SOS relaxations.
Contribution
The paper proves a new lower bound for the SOS relaxation of the Paley graph's clique number and analyzes its optimality and limitations compared to random graphs.
Findings
Degree 4 SOS lower bound is (p^{1/3}) for Paley graphs.
Lower bound is optimal for Feige-Krauthgamer pseudomoments.
Numerical experiments suggest SOS may scale as (p^{1/2 - \u03b5}) but cannot surpass the (p^{1/3}) barrier.
Abstract
We prove that the degree 4 sum-of-squares (SOS) relaxation of the clique number of the Paley graph on a prime number of vertices has value at least . This is in contrast to the widely believed conjecture that the actual clique number of the Paley graph is . Our result may be viewed as a derandomization of that of Deshpande and Montanari (2015), who showed the same lower bound (up to terms) with high probability for the Erd\H{o}s-R\'{e}nyi random graph on vertices, whose clique number is with high probability . We also show that our lower bound is optimal for the Feige-Krauthgamer construction of pseudomoments, derandomizing an argument of Kelner. Finally, we present numerical experiments indicating that the value of the degree 4 SOS relaxation of the Paley graph may scale as for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
