Unitarily achievable zero patterns and traces of words in A and A |
| |
Authors: | Dragomir ? ?okovi? Charles R Johnson |
| |
Institution: | Department of Pure Mathematics, University of Waterloo, Waterloo, Ont., Canada N2L 3G1 Department of Mathematics, College of William and Mary, Williamsburg, VA 23187-8795, USA |
| |
Abstract: | Our primary objective is to identify a natural and substantial problem about unitary similarity on arbitrary complex matrices: which 0-patterns may be achieved for any given n-by-n complex matrix via some unitary similarity of it. To this end, certain restrictions on “achievable” 0-patterns are mentioned, both positional and, more important, on the maximum number of achievable 0’s. Prior results fitting this general question are mentioned, as well as the “first” unresolved pattern (for 3-by-3 matrices!). In the process a recent question is answered.A closely related additional objective is to mention the best known bound for the maximum length of words necessary for the application of Specht’s theorem about which pairs of complex matrices are unitarily similar, which seems not widely known to matrix theorists. In the process, we mention the number of words necessary for small size matrices. |
| |
Keywords: | Primary 15A21 15A57 Secondary 15A72 |
本文献已被 ScienceDirect 等数据库收录! |
|