Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Bounding the Bethe and the Degree-$M$ Bethe Permanents (1503.02217v1)

Published 7 Mar 2015 in cs.IT, cs.CC, math-ph, math.CO, math.IT, and math.MP

Abstract: It was recently conjectured that the permanent of a ${P}$-lifting $\theta{\uparrow{P}}$ of a matrix $\theta$ of degree $M$ is less than or equal to the $M$th power of the permanent perm$(\theta)$, i.e., perm$(\theta{\uparrow{P}})\leq(\text{perm}(\theta))M$ and, consequently, that the degree-$M$ Bethe permanent $\text{perm}{M,\mathrm{B}} (\theta)$ of a matrix $\theta$ is less than or equal to the permanent perm$(\theta)$ of $\theta$, i.e., perm${M, \mathrm{B}} (\theta)\leq \text{perm}(\theta)$. In this paper, we prove these related conjectures and show in addition a few properties of the permanent of block matrices that are lifts of a matrix. As a corollary, we obtain an alternative proof of the inequality perm$_{\mathrm{B}} (\theta)\leq \text{perm}(\theta)$ on the Bethe permanent of the base matrix $\theta$ that uses only the combinatorial definition of the Bethe permanent.

Citations (5)

Summary

We haven't generated a summary for this paper yet.