3 problems

Let $\mathsf{N}$ be a double-edge normal factor graph (DE-NFG). For each integer $M\geq 1$, let $Z_{\mathrm{B},M}(\mathsf{N})$ denote the degree-$M$ Bethe partition function, defin…

Graph-cover characterization conjecture. It holds that

Consider the non-random theories described in the preceding conjecture and the factor graphs associated with them. Subleading-corrections conjecture. In such theories, the correcti…