Problem detail · source-aware
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
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 $\widehat P(A)$ satisfies $e^{-\gamma n}\widehat P(A) \le \mathrm{per}(A) \le \widehat P(A)$, giving a deterministic $e^{(\gamma+\varepsilon)n}$-approximation for every $\varepsilon > 0$ and matching the known $e^{(\gamma-\varepsilon)n}$ hardness, where $\gamma$ is the Euler-Mascheroni constant.
The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement fidelity, correctness, priority, or novelty.
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.
Provider: OpenAI · Prompt public: unknown · Independence: unknown
Both authors state they verified the theorem and proof. The result is a sandwich inequality around an explicit concave maximisation, so it is checkable by following the argument. arXiv preprint, not peer-reviewed.
Correctness: unknown · statement fidelity: unaudited · peer review: none
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Source-reported tools: argument.
Independent: unknown · difference confidence: 0
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.