Papers
Topics
Authors
Recent
Search
2000 character limit reached

Gram-like matrix preserving extensions and completions of noncommutative polynomials

Published 21 Jan 2025 in math.OC, math.AC, math.AG, and math.FA | (2501.12063v2)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.