On Chollet's Permanent Conjecture for Graph Laplacians

TL;DR

This paper proves a specific permanental inequality for certain matrices and extends it to graph Laplacians, providing new insights into a P-hard problem through a compositional framework.

Contribution

The authors establish a permanental inequality for symmetric Z-matrices with bipartite support graphs and develop a framework to extend these inequalities to complex graph Laplacians.

Findings

Proved permanent inequality for symmetric Z-matrices with bipartite support.

Developed a compositional framework for permanental inequalities on graph Laplacians.

Extended inequalities to large structured graph families, revealing new tractable regimes.

Abstract

In 1982, Chollet conjectured that $\mathrm{per}(A\circ B)\le \mathrm{per}(A)\mathrm{per}(B)$ for Hermitian positive semidefinite matrices $A,B$, where $\circ$ denotes the Hadamard product, and observed that in the real symmetric case it suffices to prove $\mathrm{per}(A\circ A)\le \mathrm{per}(A)^2$. We prove $\mathrm{per}(A\circ A)\le \mathrm{per}(A)^2$ for symmetric $Z$-matrices with nonnegative diagonal whose support graph is bipartite. Motivated by this, we study the Laplacian inequality $\mathrm{per}(L_G\circ L_G)\le \mathrm{per}(L_G)^2$ for the graph Laplacian $L_G$. We introduce a compositional framework for permanental inequalities on graph Laplacians, showing that Chollet's inequality is preserved under vertex coalescence. This enables the extension of the inequality from basic graph classes to large structured families, revealing new tractable regimes for a fundamentally $\#P$-hard quantity.