arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0901.3010math.RT
收藏

关于一类Tame问题

On a subclass of tame problems

N. Vanetik

摘要:

在表示论中,将矩阵对分类到同时相似性的问题被用作复杂性的度量;包含它的分类问题被称为野生问题,其他被称为驯服问题。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑