Journal of the London Mathematical Society Advance Access published online on November 20, 2007
Journal of the London Mathematical Society, doi:10.1112/jlms/jdm070
| ||||||||||||||||||||||||||||||||||||||||||||||||||
© 2007 London Mathematical Society
Solvability of symmetric word equations in positive definite letters
Department of Mathematics
University of California
Berkeley
CA 94720
USA
sarm{at}math.berkeley.edu
Department of Mathematics
Texas A&M University
College Station
TX 77843
USA
Let S(X, B) be a symmetric (palindromic) word in two letters X and B. A theorem due to Hillar and Johnson states that for each pair of positive definite matrices B and P, there is a positive definite solution X to the word equation S(X, B)=P. They also conjectured that these solutions are finite and unique. In this paper, we resolve a modified version of this conjecture by showing that the Brouwer degree of such an equation is equal to 1 (in the case of real matrices). It follows that, generically, the number of solutions is odd (and thus finite) in the real case. Our approach allows us to address the more subtle question of uniqueness by exhibiting equations with multiple real solutions, as well as providing a second proof of the result of Hillar and Johnson in the real case.
2000 Mathematics Subject Classification 15A24, 15A57; 15A18, 15A90.
The work of the second author is supported under a National Science Foundation Postdoctoral Fellowship.
Received July 27, 2006; revised March 16, 2007;
![]()
CiteULike
Connotea
Del.icio.us What's this?