← All problems

Refined Bessis–Moussa–Villani conjecture

For Hermitian matrices α,β\alpha,\beta and nonnegative integers n,mn,m, let An,m(X,Y)\mathcal A_{n,m}(X,Y) denote the average of Tr⁡(W)\operatorname{Tr}(W) over all words WW containing nn copies of XX and mm copies of YY. The lower-bound part of the refined Bessis–Moussa–Villani conjecture asserts that An,m(eα,eβ)≥Tr⁡ ⁣(enα+mβ)\mathcal A_{n,m}(e^\alpha,e^\beta)\geq \operatorname{Tr}\!\left(e^{n\alpha+m\beta}\right) for all n,mn,m and all Hermitian α,β\alpha,\beta.

References

Progress summary

Refreshed
Open · solution reported

A 2026 preprint claims the refinement is false, while other work proves only restricted lower-bound cases and proposes a corrected version.

The refinement strengthens the original BMV conjecture by imposing bounds on normalized averages of traces of matrix words. The original BMV conjecture was posed in 1975 and proved by Stahl in 2013; the refined statement remains unsettled.

Known results

  • The original BMV conjecture was proved by Stahl in 2013; this does not establish the later refinement.

2026 counterexample and restricted lower bounds

On March 20, 2026, Cha reported a 3×33\times3 positive-semidefinite counterexample at (n,m)=(5,5)(n,m)=(5,5) to the refined upper bound, with divergence for min⁡{n,m}>4\min\{n,m\}>4; this is an unverified claimed refutation. Dinh proposed a pinching-based correction and proved a partial case with m=2m=2. Hägele’s October 2026 preprint claims the lower bound for n+m≤7n+m\le 7 in dimensions up to three and for min⁡{n,m}≤2\min\{n,m\}\le2 in arbitrary dimension. ChatGPT assisted Dinh, Le, and Vuong with calculations and checks, according to MathWorld.

Current status (as of November 2026): The refined upper bound is claimed false, while restricted lower-bound cases are claimed proved; the broader refined conjecture has no independently verified resolution.

Sources

Solutions 0

No solutions have been posted yet.