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

寻找群中的非平凡元素和分裂

Finding non-trivial elements and splittings in groups

Maurice Chiodo

摘要:

这是众所周知的,平凡的问题,提出的群体是无法解决的,我们问的问题,是否存在一个一般的程序,以产生一个非平凡的元素,从一个有限的介绍一个非平凡的群体。如果不是,那么这就解决了J. Wiegold的一个公开问题:“是不是每一个生成的完满群都是一个元素的正规闭包?“我们证明了我们问题的一个弱化版本:没有一般程序可以从非平凡群的有限表示中选择非平凡生成元。我们还表明,既没有一个一般的程序来分解一个非平凡的自由积的有限表示成两个非平凡的双表示因子,也没有一个从一个双表示群到另一个它嵌入的嵌入构造。我们应用我们的结果表明,一个建设Stallings分裂群有一个以上的结束永远不能算法,也不能分裂连接的非单连通封闭4-流形的总和的过程。

英文摘要:

It is well known that the triviality problem for finitely presented groups is unsolvable; we ask the question of whether there exists a general procedure to produce a non-trivial element from a finite presentation of a non-trivial group. If not, then this would resolve an open problem by J. Wiegold: `Is every finitely generated perfect group the normal closure of one element?' We prove a weakened version of our question: there is no general procedure to pick a non-trivial generator from a finite presentation of a non-trivial group. We also show there is neither a general procedure to decompose a finite presentation of a non-trivial free product into two non-trivial finitely presented factors, nor one to construct an embedding from one finitely presented group into another in which it embeds. We apply our results to show that a construction by Stallings on splitting groups with more than one end can never be made algorithmic, nor can the process of splitting connect sums of non-simply connected closed 4-manifolds.

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

↑