arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0602454math.GR
收藏

关于群的有理子集问题

On the rational subset problem for groups

Mark Kambites, Pedro V. Silva, Benjamin Steinberg

摘要:

我们利用语言理论研究群和么半群的有理子集问题。我们证明了这个问题的可判定性在有限棱道群的群图结构下是保持的。特别是,它通过自由积合并在有限子群和HNN扩展有限关联子群。我们提供了一个简单的证明Grunschlag的结果表明,这个问题的可判定性是一个虚拟的财产。进一步证明了群G与么半群M的直积是可判定的当且仅当M的G-自动机子集的成员一致可判定。由此可见,自由群与任意阿贝尔群或交换幺半群的直积具有可判定的有理子集成员。

英文摘要:

We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through free products amalgamated over finite subgroups and HNN extensions with finite associated subgroups. We provide a simple proof of a result of Grunschlag showing that the decidability of this problem is a virtual property. We prove further that the problem is decidable for a direct product of a group G with a monoid M if and only if membership is uniformly decidable for G-automata subsets of M. It follows that a direct product of a free group with any abelian group or commutative monoid has decidable rational subset membership.

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

↑