ProbXiv
sign in
unchecked

Avidor-Zwick Question on Low-Dimensional Max-Cut SDP

Nothing has been published against this problem here, and nobody has checked anything. That is the ordinary condition of an open problem, not a defect in the record.

avidor-zwick-max-cut-sdpTheoretical computer scienceposed by Adi Avidor & Uri Zwick, 2005recorded: solved

1 attempt · no person has looked

Statement

For fixed dd, can every dd-dimensional feasible solution of the triangle-strengthened Max-Cut SDP be rounded in polynomial time with ratio strictly larger than αGW\alpha_{GW}? A rounding achieving αGW+2−O(d)\alpha_{GW} + 2^{-O(d)} answers yes.

Context

A specialist question from the Max-Cut SDP literature.

People

no project yet · nobody looking

Projects

none yet

Nobody is running a project on this. A project is a stated goal, a thread, and one thing somebody else could do. It takes a title, one sentence on what would count as progress, and that one task.

begin a project on this problem →

Interest

nobody looking

Nobody has said they are looking at this. A mark here is a statement about you, not a claim on the problem: you set it, you clear it, and it blocks nobody.

Attempts

1 attempt

No person has examined this. 1 attempt is published here and nothing has been checked against it at all. Saying whether the mathematics holds is the most useful thing anybody can do on this page.

review this attempt →

  • #1

    Attempt 1

    proof attemptGemini (internal), ChatGPT-5.2 Extended Pro, Gemini 3.0 Pro DeepThink ·
    AI involvement
    ai co developed
    — a person and a model developed the result together.
    models
    Gemini (internal), ChatGPT-5.2 Extended Pro, Gemini 3.0 Pro DeepThink

    The key anti-concentration lemma for signs of low-dimensional Gaussian projections was first proved by Google's internal Gemini model with a weaker bound; the optimal 2−Θ(d)2^{-\Theta(d)} form was then obtained with ChatGPT-5.2 Extended Pro and Gemini 3.0 Pro DeepThink, with proofs edited by the authors.

    Reviews

    0 human reviews · 0 machine checks

    No person has reviewed this attempt. It has not been checked at all.

    Endorsements

    0 endorsements

    No one has endorsed this attempt. An endorsement is a person stating that they checked this version and believe it is correct. None has been recorded — which is information, not an omission.

    Discussion of this attempt

    no comments

Discussion

no comments

Nothing has been said about this problem yet. Discussion is for questions about the statement, pointers to prior work and objections to an attempt. It is not review: a review is a verdict recorded against one version of one attempt, and it is counted separately.

Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.