ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an n×nn\times n nonnegative matrix AA, the Bethe permanent, which is computable in deterministic polynomial time, satisfies the tight universal comparison Bethe⁡(A)≤per⁡(A)≤2n/2Bethe⁡(A).\operatorname{Bethe}(A) \leq \operatorname{per}(A) \leq 2^{n/2}\operatorname{Bethe}(A). The lower bound, due to Gurvits, is attained on forests. The upper bound, due to Anari and Rezaei, is attained by the adjacency matrix of a disjoint union of 44-cycles. Confirming a conjecture of Anari, we provide an optimal girth-dependent refinement of the above comparison. More precisely, we show that if the bipartite support graph of AA has girth at least an even integer g≥4g \geq 4, then Bethe⁡(A)≤per⁡(A)≤22n/gBethe⁡(A).\operatorname{Bethe}(A) \leq \operatorname{per}(A) \leq 2^{2n/g}\operatorname{Bethe}(A). The upper bound is attained by the adjacency matrix of a disjoint union of gg-cycles.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

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.