The positive trace conjecture for words in two positive definite matrices
Statement
Let a word be a product formed from two real positive definite matrices. A word is symmetric if it is unchanged by reversal, and a product of two symmetric words means their juxtaposition. Positive trace conjecture. A word has positive trace for every pair of real positive definite matrices if and only if the word is symmetric or a product of two symmetric words. This conjecture concerns the characterization of words whose trace is always positive; the supplied text gives no resolution status.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.