arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.01601math.GR
收藏

具有EDT0L表示的群

Groups with presentations in EDT0L

Laurent Bartholdi, Leon Pernak, Emmanuel Rauzy

AI总结:

该研究明确EDT0L表示群类等价于2003年提出的L表示群类,证明其标记同构问题非半可判定,扩展统一幂零/有限商结果,还构造出无EDT0L表示的递归表示群并证明$π(\text{EDT0L})\ne π(\text{REC})$。

摘要:

对于任意语言族LAN,我们将有限生成群的类记为$π(\text{LAN})$,这类群允许群表示且其关系子集合构成LAN中的语言。我们证明,第一作者2003年引入的L表示群类恰好是允许EDT0L语言族表示的群类。我们表明,EDT0L表示给出的群的标记同构问题不是半可判定的,这与有限表示的情况相反。然后,我们扩展并统一了第一作者与Eick和Hartung关于幂零商和有限商的结果,证明可以计算EDT0L表示群的标记双曲商和标记亚交换商。最后,我们展示商计算结果如何构造无EDT0L表示的递归表示群,从而证明$π(\text{EDT0L})\ne π(\text{REC})$,这通过构建具有可解字问题且极大幂零商序列不可计算的剩余幂零群实现。

英文摘要:

To any family of languages LAN, let us associate the class, denoted $π(\text{LAN})$, of finitely generated groups that admit a group presentation whose set of relators forms a language in LAN. We show that the class of L-presented groups, as introduced by the first author in 2003, is exactly the class of groups that admit presentations in the family of languages EDT0L. We show that the marked isomorphism problem is not semi-decidable for groups given by EDT0L presentations, contrary to the finite presentation case. We then extend and unify results of the first author with Eick and Hartung about nilpotent and finite quotients, by showing that it is possible to compute the marked hyperbolic and marked metabelian quotients of a group given by an EDT0L presentation. Finally, we show how the results about quotient computations enable the construction of recursively presented groups that do not have EDT0L presentations, thus proving $π(\text{EDT0L})\ne π(\text{REC})$. This is done by building a residually nilpotent group with solvable word problem whose sequence of maximal nilpotent quotients is non-computable.

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

↑