Problems / combinatorics
combinatorics / Permanent approximation
Anari's Bethe permanent conjecture
For every nonnegative n×n matrix A whose bipartite support graph has girth at least an even integer g≥4, Dong and Jain prove the sharp inequality
Bethe(A)≤per(A)≤22n/gBethe(A).
The factor 22n/g is optimal whenever g∣2n, attained by matrices whose support graphs are disjoint unions of g-cycles. Thus the result confirms Anari's conjecture, recovers the sharp 2n/2 universal Anari--Rezaei bound when g=4, and approaches exactness as the support-graph girth tends to infinity.