Wild problem

A mathematical problem is wild if it contains the problem of classifying pairs of square matrices up to simultaneous similarity.[1] Examples of wild problems are classifying indecomposable representations of any quiver that is neither a Dynkin quiver (i.e. the underlying undirected graph of the quiver is a (finite) Dynkin diagram) nor a Euclidean quiver (i.e., the underlying undirected graph of the quiver is an affine Dynkin diagram).

Necessary and sufficient conditions have been proposed to check the simultaneously block triangularization and diagonalization of a finite set of matrices under the assumption that each matrix is diagonalizable over the field of the complex numbers.[2]

References

Belitskii, Genrich R.; Sergeichuk, Vladimir V. (2003), "Complexity of matrix problems", Linear Algebra and Its Applications, 361: 203–222, arXiv:0709.2488, doi:10.1016/S0024-3795(02)00391-9, S2CID 115157068
Mesbahi, Afshin; Haeri, Mohammad (January 2015). "Conditions on Decomposing Linear Systems With More Than One Matrix to Block Triangular or Diagonal Form". IEEE Transactions on Automatic Control. 60 (1): 233–239. doi:10.1109/tac.2014.2326292. ISSN 0018-9286. S2CID 27053281.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[1] Belitskii, Genrich R.; Sergeichuk, Vladimir V. (2003), "Complexity of matrix problems", Linear Algebra and Its Applications, 361: 203–222, arXiv:0709.2488, doi:10.1016/S0024-3795(02)00391-9, S2CID 115157068

[2] Mesbahi, Afshin; Haeri, Mohammad (January 2015). "Conditions on Decomposing Linear Systems With More Than One Matrix to Block Triangular or Diagonal Form". IEEE Transactions on Automatic Control. 60 (1): 233–239. doi:10.1109/tac.2014.2326292. ISSN 0018-9286. S2CID 27053281.