ProbXiv
sign in
Problem archiveProblem record

Statement

What is the best deterministic polynomial-time approximation ratio for the permanent of a Hermitian positive semidefinite matrix? Resolved up to lower-order terms in the exponent: an explicit concave maximisation P^(A)\widehat P(A) satisfies e−γnP^(A)≤per(A)≤P^(A)e^{-\gamma n}\widehat P(A) \le \mathrm{per}(A) \le \widehat P(A), giving a deterministic e(γ+ε)ne^{(\gamma+\varepsilon)n}-approximation for every ε>0\varepsilon > 0 and matching the known e(γ−ε)ne^{(\gamma-\varepsilon)n} hardness, where γ\gamma is the Euler-Mascheroni constant.

Record

Comments

No person has examined this. Nothing here has been checked at all. say whether it holds →

  1. proof attempt · #1

    Nima Anari and Farzam Ebrahimnejad, using GPT 5.5 Pro Extended

    That credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.

    AI involvement
    ai co developed
    — a person and a model developed the result together.

    The authors describe two different interaction styles converging on the same result: the first author's interaction was one-shot, the second author's involved high-level guidance. Both state they verified the theorem and proof themselves. Codex was used separately to assemble and typeset the manuscript, and the disclosure keeps that clerical use distinct from the mathematics.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.