Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.28031

Beyond the Bethe Approximation of the Permanent

Nima Anari
View original source ↗Read source document ↗Export metadata ↓

Abstract

The canonical Bethe approximation gives a deterministic approximation to the permanent of every nonnegative matrix within a factor of $(\sqrt{2})^n$. We improve the base of this exponential factor: for some absolute constant $c<\sqrt{2}$, there is a deterministic polynomial-time $c^n$-approximation for the permanent of every nonnegative matrix. This shows that the canonical Bethe guarantee is not a barrier for deterministic approximation of the permanent. The proof augments the Bethe lower bound with a new certificate tailored to matrices on which that lower bound loses nearly the full factor. The author supplied the high-level plan of attack, and the proof was developed in an interaction with ChatGPT 5.6 Sol Pro. The author subsequently verified the results. Codex assisted with proof checking, manuscript assembly, and typesetting.

Explore related subjects

cs.DSmath.CO

Keep this discovery

BibTeXRIS

Nima Anari. 2026-09-01. Beyond the Bethe Approximation of the Permanent. https://arxiv.org/abs/2608.28031

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.DS subjectmath.CO subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Oracle-free Boltzmann Sampling for Powersets

We propose an approach for sampling powersets under the Boltzmann distribution in an oracle-free way, i.e. without numerically evaluating the associated generating function. Our approach relies on a Poissonised infinite occupancy model and thinning. It yields an explicit sampler for bounded counting sequences and extends under mild growth conditions. We implement the sampler and find runtimes comparable to existing Boltzmann samplers.

cs.DM↗
arXiv2026

Improved Integrality Gap for Multicommodity Flow on Trees

We improve the best known lower bound on the integrality gap for weighted unit-demand multicommodity flow on trees from $1/4$ to $2/5$, improving on the long-standing bound of Chekuri, Mydlarz, and Shepherd~\cite{CMS}. We give the proof in two stages. First, a surprisingly simple packing lemma and an inductive coloring argument give an intermediate bound of $4/11$. We then refine the argument to obtain $2/5$.

cs.DS↗
arXiv2026

An Exposition of the $\widetilde{O}(\log^{1/4} n)$ Bound for the Komlós Problem

A conjecture of Komlós states that the combinatorial discrepancy of any matrix $A\in\mathbb R^{m\times n}$ whose columns have Euclidean norm at most one is bounded by a universal constant. We prove that the combinatorial discrepancy of every such matrix is at most $O((\log n)^{1/4}(\log\log n)^{7/4})$. This is the first asymptotic improvement over the $O(\sqrt{\log n})$ bound established by Banaszczyk [Banaszczyk, Random Struct.\ Algorithms, 1998], and it refutes a conjecture of Hajela [Hajela, European J.\ Combin., 1988] that a lower bound of order $Ω(\sqrt{\log n})$ should hold.

math.CO↗