Near-square-root logarithmic integrality gaps for uniform sparsest cut

Get email updates

OpenAI

For a sequence of n-vertex uniform-demand instances, the Goemans–Linial SDP integrality gap is at least c(log⁡n)/(log⁡log⁡n)3c\sqrt{(\log n)}/(\log \log n)^{3} for an absolute c>0c>0.

What was already known

Prior Kane–Meka gaps and the Arora–Rao–Vazirani upper bound are distinct. This is a relaxation gap, not the cataloged NP-hardness of approximation.

AI involvement AI-led

The manuscript credits OpenAI as author, and the pinned release attributes its manuscripts to the internal model. Individual session details are undocumented.

Importance Notable

Matches the square-root logarithmic exponent of the earlier upper bound up to iterated logarithmic factors.

Technical verification Formal (Lean)

OpenAI’s Lean scope identifies the stated ratio with unit pair demands, nonnegative capacities and positive relaxation optimum.

Formal checking

OpenAI’s Lean scope identifies the stated ratio with unit pair demands, nonnegative capacities and positive relaxation optimum.

Checker
OpenAI’s reported Lean formalization
Scope
OpenAI’s Lean scope identifies the stated ratio with unit pair demands, nonnegative capacities and positive relaxation optimum.
Basis
Reported by the linked checker

Human understanding Few

The reviewed sources do not document a human explanation of the assessed contribution.

Correction and publication history