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

有限群的混合代数问题

Algorithmic Problems in Amalgams of Finite Groups

L. Markus-Epstein

摘要:

Stallings提出的处理自由群的生成子群的几何方法被成功地用于解决自由群及其子群的判定问题。结果表明,Stallings方法可以有效地推广到有限群的混合类.本文利用由广义Stallings折叠算法构造的子群图来解决有限群的混合中的各种算法问题。

英文摘要:

Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. It turns out that Stallings' methods can be effectively generalized for the class of amalgams of finite groups. In the present paper we employ subgroup graphs constructed by the generalized Stallings' folding algorithm to solve various algorithmic problems in amalgams of finite groups.

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

↑