pith. sign in

arxiv: 1503.02217 · v1 · pith:W7XDSIJFnew · submitted 2015-03-07 · 💻 cs.IT · cs.CC· math-ph· math.CO· math.IT· math.MP

Bounding the Bethe and the Degree-M Bethe Permanents

classification 💻 cs.IT cs.CCmath-phmath.COmath.ITmath.MP
keywords thetapermpermanentbethematrixtextmathrmdegree-
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.