pith. sign in

arxiv: 0905.0420 · v3 · pith:LGPBFGZInew · submitted 2009-05-04 · 🧮 math.RA · math-ph· math.MP· math.OA

Sum--of--squares results for polynomials related to the Bessis--Moussa--Villani conjecture

classification 🧮 math.RA math-phmath.MPmath.OA
keywords conjectureequalhermitianbessis--moussa--villanicommutatorsevenmatricesnonnegative
0
0 comments X
read the original abstract

We show that the polynomial S_{m,k}(A,B), that is the sum of all words in noncommuting variables A and B having length m and exactly k letters equal to B, is not equal to a sum of commutators and Hermitian squares in the algebra R<X,Y> where X^2=A and Y^2=B, for all even values of m and k with 6 <= k <= m-10, and also for (m,k)=(12,6). This leaves only the case (m,k)=(16,8) open. This topic is of interest in connection with the Lieb--Seiringer formulation of the Bessis--Moussa--Villani conjecture, which asks whether the trace of S_{m,k}(A,B)) is nonnegative for all positive semidefinite matrices A and B. These results eliminate the possibility of using "descent + sum-of-squares" to prove the BMV conjecture. We also show that S_{m,4}(A,B) is equal to a sum of commutators and Hermitian squares in R<A,B> when m is even and not a multiple of 4, which implies that the trace of S_{m,4}(A,B) is nonnegative for all Hermitian matrices A and B, for these values of m.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. On the Failure of the Upper Bound in the Refined BMV Conjecture and a Pinching Correction

    math.CO 2026-05 conditional novelty 7.0

    The refined BMV upper bound fails for 3x3 PSD matrices, explained via non-canonical common parts, and a pinching refinement is proposed and proved for the n,2 case as a sandwich inequality.