$2\times 2$整数矩阵成员问题的判定性
Decidability of the Membership Problem for $2\times 2$ integer matrices
摘要:
本文的主要结果是$2\times 2$非奇异整数矩阵隶属度问题的可判定性。也就是说,我们将构造第一个算法,对任何非奇异的$2\times 2$整数矩阵$M_1,\dots,M_n$和$M$决定$M$是否属于由$\{M_1,\dots,M_n\}$生成的半群。我们的算法依赖于一个翻译的矩阵上的数值问题的组合问题的话。它还利用了$\mathrm{GL}(2,\mathbb{Z})$的一些著名子群的代数性质和各种新的技术和构造,这些技术和构造通过将它们简化为正则语言的成员问题来帮助限制无限数量的可能性。
英文摘要:
The main result of this paper is the decidability of the membership problem for $2\times 2$ nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular $2\times 2$ integer matrices $M_1,\dots,M_n$ and $M$ decides whether $M$ belongs to the semigroup generated by $\{M_1,\dots,M_n\}$. Our algorithm relies on a translation of the numerical problem on matrices into combinatorial problems on words. It also makes use of some algebraical properties of well-known subgroups of $\mathrm{GL}(2,\mathbb{Z})$ and various new techniques and constructions that help to limit an infinite number of possibilities by reducing them to the membership problem for regular languages.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。