theoretical-computer-science / Approximation algorithms; semidefinite relaxations and metric embeddings

The Goemans-Linial integrality gap for uniform sparsest cut is nearly square-root logarithmic

Theorem 1.1: there are an absolute c>0c>0 and uniform-demand instances on nj→∞n_j\to\infty vertices with Goemans-Linial integrality gap at least clog⁡nj/(log⁡log⁡nj)3c\sqrt{\log n_j}/(\log\log n_j)^3. This improves the Kane-Meka bound exp⁡(Ω(log⁡log⁡n))\exp(\Omega(\sqrt{\log\log n})) to within (log⁡log⁡n)3(\log\log n)^3 of the ARV upper bound. It is an existential sequence of sizes, not a bound at every nn; it does not determine whether the gap is exactly Θ(log⁡n)\Theta(\sqrt{\log n}), and it concerns the basic SDP, not Sherali-Adams or Lasserre strengthenings.

28Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

theoretical-computer-scienceSep 24, 2026Significance 28/100Registry: lean checked

The Goemans-Linial integrality gap for uniform sparsest cut is nearly square-root logarithmic

Prior state unknown→proved

Theorem 1.1: there are an absolute c>0c>0 and uniform-demand instances on nj→∞n_j\to\infty vertices with Goemans-Linial integrality gap at least clog⁡nj/(log⁡log⁡nj)3c\sqrt{\log n_j}/(\log\log n_j)^3. This improves the Kane-Meka bound exp⁡(Ω(log⁡log⁡n))\exp(\Omega(\sqrt{\log\log n})) to within (log⁡log⁡n)3(\log\log n)^3 of the ARV upper bound. It is an existential sequence of sizes, not a bound at every nn; it does not determine whether the gap is exactly…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Theorem 1.1: there are an absolute c>0c>0 and uniform-demand instances on nj→∞n_j\to\infty vertices with Goemans-Linial integrality gap at least clog⁡nj/(log⁡log⁡nj)3c\sqrt{\log n_j}/(\log\log n_j)^3. This improves the Kane-Meka bound exp⁡(Ω(log⁡log⁡n))\exp(\Omega(\sqrt{\log\log n})) to within (log⁡log⁡n)3(\log\log n)^3 of the ARV upper bound. It is an existential sequence of sizes, not a bound at every nn; it does not determine whether the gap is exactly Θ(log⁡n)\Theta(\sqrt{\log n}), and it concerns the basic SDP, not Sherali-Adams or Lasserre strengthenings.

Theorem 1.1: there are an absolute c>0c>0 and uniform-demand instances on nj→∞n_j\to\infty vertices with Goemans-Linial integrality gap at least clog⁡nj/(log⁡log⁡nj)3c\sqrt{\log n_j}/(\log\log n_j)^3. This improves the Kane-Meka bound exp⁡(Ω(log⁡log⁡n))\exp(\Omega(\sqrt{\log\log n})) to within (log⁡log⁡n)3(\log\log n)^3 of the ARV upper bound. It is an existential sequence of sizes, not a bound at every nn; it does not determine whether the gap is exactly Θ(log⁡n)\Theta(\sqrt{\log n}), and it concerns the basic SDP, not Sherali-Adams or Lasserre strengthenings.

Recorded attempts

Evidence graph

Connected research record