张量的疯狂
Wildness for tensors
摘要:
在表示论中,如果一个分类问题包含对矩阵对进行分类直到同时相似的问题,则该分类问题被称为野问题。后一个问题被认为是无望的;它包含了一个任意的向量空间和它们之间的线性映射有限系统的分类问题。我们证明了一个类似的"普遍"问题,在理论上的张量最多为3在一个任意领域是分类的问题,三维数组的等价变换\[ [a_{ijk}]_{i=1}^{m}\,{}_{j=1}^{n}\,{}_{k=1}^{t}\ \mapsto\ \Bigl[ \sum_{i,j,k} a_{ijk}u_{ii'} v_{jj'}w_{kk'}\Bigr]{}_{i'=1}^{m}\,{}_{j'=1}^{n}\,{}_{k'=1}^{t} \],其中$[u_{ii'}]$,$[v_{jj'}]$,$[w_{kk'}]$是非奇异矩阵:这个问题包含的问题,分类一个任意系统的张量的顺序最多为3。
英文摘要:
In representation theory, a classification problem is called wild if it contains the problem of classifying matrix pairs up to simultaneous similarity. The latter problem is considered as hopeless; it contains the problem of classifying an arbitrary finite system of vector spaces and linear mappings between them. We prove that an analogous "universal" problem in the theory of tensors of order at most 3 over an arbitrary field is the problem of classifying three-dimensional arrays up to equivalence transformations \[ [a_{ijk}]_{i=1}^{m}\,{}_{j=1}^{n}\,{}_{k=1}^{t}\ \mapsto\ \Bigl[ \sum_{i,j,k} a_{ijk}u_{ii'} v_{jj'}w_{kk'}\Bigr]{}_{i'=1}^{m}\,{}_{j'=1}^{n}\,{}_{k'=1}^{t} \] in which $[u_{ii'}]$, $[v_{jj'}]$, $[w_{kk'}]$ are nonsingular matrices: this problem contains the problem of classifying an arbitrary system of tensors of order at most three.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。