arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0708.3190math.RAmath.AC
收藏

有限维空间上无限多个半单表示的检测

Detecting Infinitely Many Semisimple Representations in a Fixed Finite Dimension

Edward S. Letzter

摘要:

令$n$是正整数,并且令$k$是符号计算可访问的字段(具有任意特性)。我们描述了一个算法测试,以确定是否有一个新提出的$k$ -代数$R$有无限多个等价类的半单表示$R \to M_n(k')$,其中$k'$是代数闭包的$k$。通过Artin,Procesi和Shirshov的著名结果,测试将问题简化为$k$上的计算交换代数。该测试说明了明确的例子,与$n = 3$。

英文摘要:

Let $n$ be a positive integer, and let $k$ be a field (of arbitrary characteristic) accessible to symbolic computation. We describe an algorithmic test for determining whether or not a finitely presented $k$-algebra $R$ has infinitely many equivalence classes of semisimple representations $R \to M_n(k')$, where $k'$ is the algebraic closure of $k$. The test reduces the problem to computational commutative algebra over $k$, via famous results of Artin, Procesi, and Shirshov. The test is illustrated by explicit examples, with $n = 3$.

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

↑