For every symmetric ("palindromic") word S(A, B) in two positive definite letters and for each fixed n-by-n positive definite B and P, it is shown that the symmetric word equation S(A, B) = P has an n ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback