arXiv:0901.3010 [math.RT]AbstractReferencesReviewsResources
On a subclass of tame problems
Published 2009-01-20, updated 2020-07-30Version 5
In representation theory, the problem of classifying pairs of matrices up to simultaneous similarity is used as a measure of complexity; classification problems containing it are called wild problems, and the other are referred to as tame.
Comments: This paper has been withdrawn by the author. Some of the results are contained in another paper. Different approach to hardness was used, and therefore some of these results are irrelevant
Categories: math.RT
Related articles: Most relevant | Search more
arXiv:1703.10093 [math.RT] (Published 2017-03-29)
Classification problems in 2-representation theory
arXiv:math/0411395 [math.RT] (Published 2004-11-17)
Representation theory of towers of recollement: theory, notes, and examples
arXiv:0712.2837 [math.RT] (Published 2007-12-17)
Voting, the symmetric group, and representation theory