关于特殊线性群与Heisenberg群的同一性问题
On the Identity Problem for the Special Linear Group and the Heisenberg Group
摘要:
我们研究矩阵的恒等式问题,即,单位矩阵是否在由给定的一组生成元生成的半群中。特别地,我们考虑特殊线性群的身份问题,最近的NP-完全性结果${\rm SL}(2,\mathbb{Z})$和$48$矩阵生成的${\rm SL}(4,\mathbb{Z})$的不可判定性。首先,我们表明,没有嵌入到$3\times3$整数矩阵的行列式为一,即从对的话,扩展到${\rm SL}(3,\mathbb{Z})$中之前已知的结果,没有嵌入到$\mathbb{C}^{2\times 2}$中。除了理论上的重要性的结果,它可以被看作是一个强有力的证据,在\slthreez的计算问题是可判定的。结果排除了将Post对应问题编码为${\rm SL}(3,\mathbb{Z})$的最自然的可能性,其中通过右乘扩展的矩阵乘积对应于图灵机模拟。然后证明了对于${\rm SL}(3,\mathbb{Z})$的一个重要子群--海森堡群${\rm H}(3,\mathbb{Z})$,恒等式问题在多项式时间内是可判定的.此外,我们推广了${\rm H}(n,\mathbb{Q})$在任意维数$n$上的可判定性结果。最后,我们正在收紧这个长期存在的开放问题的可判定性问题的差距,通过提高不可判定性结果的身份问题在${\rm SL}(4,\mathbb{Z})$大幅降低的发电机组的大小从$48$到$8$开发一种新的减少技术。
英文摘要:
We study the identity problem for matrices, i.e., whether the identity matrix is in a semigroup generated by a given set of generators. In particular we consider the identity problem for the special linear group following recent NP-completeness result for ${\rm SL}(2,\mathbb{Z})$ and the undecidability for ${\rm SL}(4,\mathbb{Z})$ generated by $48$ matrices. First we show that there is no embedding from pairs of words into $3\times3$ integer matrices with determinant one, i.e., into ${\rm SL}(3,\mathbb{Z})$ extending previously known result that there is no embedding into $\mathbb{C}^{2\times 2}$. Apart from theoretical importance of the result it can be seen as a strong evidence that the computational problems in \slthreez are decidable. The result excludes the most natural possibility of encoding the Post correspondence problem into ${\rm SL}(3,\mathbb{Z})$, where the matrix products extended by the right multiplication correspond to the Turing machine simulation. Then we show that the identity problem is decidable in polynomial time for an important subgroup of ${\rm SL}(3,\mathbb{Z})$, the Heisenberg group ${\rm H}(3,\mathbb{Z})$. Furthermore, we extend the decidability result for ${\rm H}(n,\mathbb{Q})$ in any dimension $n$. Finally we are tightening the gap on decidability question for this long standing open problem by improving the undecidability result for the identity problem in ${\rm SL}(4,\mathbb{Z})$ substantially reducing the bound on the size of the generator set from $48$ to $8$ by developing a novel reduction technique.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。