arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.05720math.GRmath.LO
收藏

可计算性、阶和可解群

Computability, orders, and solvable groups

Arman Darbinyan

摘要:

本文的主要目的是以下两个结果。(1)存在一个不具有可计算双序的可计算双序群;(2)存在一个具有不可判定字问题的双序、二生成递归呈现可解群。这两个群都可以在导出长度为$3$的二生成可解群中找到。(1)回答了唐尼和库尔茨提出的问题;(2)回答了布鲁多夫和格拉斯在《考罗夫卡笔记本》中提出的问题。用于获得主要结果的技术工具之一是B的嵌入定理的计算扩展。诺依曼,这是作者以前研究过的。在本文中,我们也恭维的结果,并得出新的推论,可能是独立的利益。

英文摘要:

The main objective of this paper is the following two results. (1) There exists a computable bi-orderable group that does not have a computable bi-ordering; (2) There exists a bi-orderable, two-generated recursively presented solvable group with undecidable word problem. Both of the groups can be found among two-generated solvable groups of derived length $3$. (1) answers a question posed by Downey and Kurtz; (2) answers a question posed by Bludov and Glass in Kourovka Notebook. One of the technical tools used to obtain the main results is a computational extension of an embedding theorem of B. Neumann that was studied by the author earlier. In this paper we also compliment that result and derive new corollaries that might be of independent interest.

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

↑