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

蝌蚪标号定向图群与循环表示群

Tadpole Labelled Oriented Graph Groups and Cyclically Presented Groups

James Howie, Gerald Williams

摘要:

研究了一类以蝌蚪图为基础的标号定向图群.我们证明了这样的群是循环表示群的自然HNN扩展,并研究了循环表示群与HNN群之间的关系。我们涉及到第二个同伦群的介绍,并表明,双曲性的循环提出的群意味着共轭问题的可解性的群。在这种情况下,标签的尾巴上的标签拼写一个积极的词在顶点的电路中,我们表明,LOG和组相吻合的Szczepanski和Vesnin考虑。我们得到新的介绍,这些循环呈现的群体,并表明,由约翰逊和Mawdesley介绍的斐波那契型群是这种形式。这些群推广了Fibonacci群和Sieradski群,并且已经被许多作者研究过。我们继续这些调查,使用小的取消和曲率的方法,以获得双曲性,自动性,SQ-普遍性,和可解性的判定问题的结果。

英文摘要:

We study a class of Labelled Oriented Graph (LOG) group where the underlying graph is a tadpole graph. We show that such a group is the natural HNN extension of a cyclically presented group and investigate the relationship between the LOG group and the cyclically presented group. We relate the second homotopy groups of their presentations and show that hyperbolicity of the cyclically presented group implies solvability of the conjugacy problem for the LOG group. In the case where the label on the tail of the LOG spells a positive word in the vertices in the circuit we show that the LOGs and groups coincide with those considered by Szczepanski and Vesnin. We obtain new presentations for these cyclically presented groups and show that the groups of Fibonacci type introduced by Johnson and Mawdesley are of this form. These groups generalize the Fibonacci groups and the Sieradski groups and have been studied by various authors. We continue these investigations, using small cancellation and curvature methods to obtain results on hyperbolicity, automaticity, SQ-universality, and solvability of decision problems.

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

↑