arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.0887math.GRmath.LOmath.RA
收藏

剩余有限算法有限群及其子群和直积

Residually finite algorithmically finite groups, their subgroups and direct products

Anton A. Klyachko, Ayrana K. Mongush

摘要:

本文构造了一个无限递归生成的递归表示的剩余有限算法有限群$G$,从而回答了Myasnikov和Osin的一个问题.此外,在$G$包含无限阿贝尔正规子群而$G$的所有有限笛卡尔幂在算法上是有限的(即,对于任何正整数$n$,不存在写出$G^n$的成对不同元素的无穷序列的算法)。并提出了几个相关问题。

英文摘要:

We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in the sense that $G$ contains an infinite abelian normal subgroup while all finite Cartesian powers of $G$ are algorithmically finite (i.e., for any positive integer $n$, there is no algorithm which writes out an infinite sequence of pairwise different elements of $G^n$). We also state several related problems.

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

↑