One-parameter counterexamples to the refined Bessis-Moussa-Villani conjecture
Hyunho Cha
Abstract
The Bessis-Moussa-Villani (BMV) conjecture, originating in quantum statistical mechanics, was proved by Stahl after an influential reformulation by Lieb and Seiringer. A later refinement asks whether the normalized average over all words with $n$ letters $A$ and $m$ letters $B$ is always bounded above by $\mathrm{tr}(A^nB^m)$ and below by $\mathrm{tr}\exp(n\log A+m\log B)$. We study a specific one-parameter family $(A_x, B_x)$ and derive exact closed formulas for both sides of the first inequality when $n=m=5$. In particular, $x=10^{-3}$ gives a counterexample and, remarkably, the ratio of the normalized word average to the trace $\mathrm{tr}(A^nB^m)$ can become arbitrarily large.
