Complexity of matrix problems

Citations of this article
Mendeley users who have this article in their library.


In representation theory, the classification problem is called wild if it contains the problem of classifying pairs of matrices up to simultaneous similarity. We show in an explicit form that the last problem contains all classification matrix problems given by quivers or posets. Then we prove that this problem does not contain (but is contained in) the problem of classifying three-valent tensors. Hence, every wild classification problem given by a quiver or poset has the same complexity; moreover, a solution of one of them implies a solution of each of the remaining problems. The problem of classifying three-valent tensors is more complicated. © 2002 Elsevier Science Inc. All rights reserved.




Belitskii, G. R., & Sergeichuk, V. V. (2003). Complexity of matrix problems. In Linear Algebra and Its Applications (Vol. 361, pp. 203–222).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free