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 ).

References

  1. ↑ Genrich R. Belitskii, Vladimir V. Sergeichuk, Complexity of matrix problems http://arxiv.org/abs/0709.2488


This article is issued from Wikipedia - version of the 8/30/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.