Gram-like matrix preserving extensions and completions of noncommutative polynomials
classification
🧮 math.OC
math.ACmath.AGmath.FA
keywords
noncommutativepositivesohsalgebraicextensionsgramgram-likematrices
read the original abstract
Given a positive noncommutative polynomial $f$, equivalently a sum of Hermitian squares (SOHS), there exists a positive semidefinite Gram matrix that encrypts all the structural essence of $f$. There are no available methods for extending a noncommutative polynomial to a SOHS keeping the Gram matrices unperturbed. As a remedy, we introduce an equally significant notion of Gram-like matrices and provide linear algebraic techniques to get the desired extensions. We further use positive semidefinite completion problem to get SOHS and provide criteria in terms of chordal graphs and 2-regular projective algebraic sets.
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.