Johnson, Charles R.; Hillar, Christopher J. Eigenvalues of words in two positive definite letters. (English) Zbl 1007.68139 SIAM J. Matrix Anal. Appl. 23, No. 4, 916-928 (2002). Summary: The question of whether all words in two real positive definite letters have only positive eigenvalues is addressed and settled (negatively). This question was raised some time ago in connection with a long-standing problem in theoretical physics. A large class of words that do guarantee positive eigenvalues is identified, and considerable evidence is given for the conjecture that no other words do. In the process, a fundamental question about solvability of symmetric word equations is encountered. Cited in 15 Documents MSC: 68R15 Combinatorics on words 81Q99 General mathematical topics and methods in quantum theory 20F10 Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) 15A42 Inequalities involving eigenvalues and eigenvectors 15A23 Factorization of matrices 15A90 Applications of matrix theory to physics (MSC2000) 15B57 Hermitian, skew-Hermitian, and related matrices Keywords:positive definite matrix; word; nearly symmetric; positive eigenvalues; palindrome; trace conjecture PDFBibTeX XMLCite \textit{C. R. Johnson} and \textit{C. J. Hillar}, SIAM J. Matrix Anal. Appl. 23, No. 4, 916--928 (2002; Zbl 1007.68139) Full Text: DOI arXiv