Refined Bessis–Moussa–Villani conjecture
For Hermitian matrices and nonnegative integers , let denote the average of over all words containing copies of and copies of . The lower-bound part of the refined Bessis–Moussa–Villani conjecture asserts that for all and all Hermitian .
References
Source: arXiv
Progress summary
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 positive-semidefinite counterexample at to the refined upper bound, with divergence for ; this is an unverified claimed refutation. Dinh proposed a pinching-based correction and proved a partial case with . Hägele’s October 2026 preprint claims the lower bound for in dimensions up to three and for 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.
Solutions 0
No solutions have been posted yet.