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

Whitehead第二类自由群算法的图论证明

A graph-theoretic proof for Whitehead's second free-group algorithm

Warren Dicks

摘要:

J.H. C怀特海的第二个自由群算法确定了一个自由群的两个给定元素是否位于该自由群的自同构群的同一轨道上。该算法涉及某些连通图,怀特黑德使用三流形模型来证明它们的连通性;后来,拉帕波特和希金斯和林登给出了群论证明。格斯滕、斯塔林斯和霍尔的综合工作表明,三流形模型可以被看作是图形。我们给怀特黑德的拓扑参数直接翻译成语言的图论。

英文摘要:

J.H.C. Whitehead's second free-group algorithm determines whether or not two given elements of a free group lie in the same orbit of the automorphism group of the free group. The algorithm involves certain connected graphs, and Whitehead used three-manifold models to prove their connectedness; later, Rapaport and Higgins & Lyndon gave group-theoretic proofs. Combined work of Gersten, Stallings, and Hoare showed that the three-manifold models may be viewed as graphs. We give the direct translation of Whitehead's topological argument into the language of graph theory.

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

↑