Tadpole labelled oriented graph groups and cyclically presented groups. (Q1952153): Difference between revisions

A labelled oriented graph (LOG) is a finite connected graph with vertex set \(V\) and edge set \(E\) together with three maps from \(\iota,\tau,\lambda\colon E\to V\) called the initial vertex map, terminal vertex map and labelling map, respectively. This determines a LOG presentation \[ \langle V\mid\tau(e)^{-1}\lambda(e)^{-1}\iota(e)\lambda(e)\;(e\in E)\rangle. \] A group with a LOG presentation is called a LOG group. In this paper the authors continue their study of a class of LOGs started by \textit{N. D. Gilbert} and \textit{J. Howie}, [J. Algebra 174, No. 1, 118-131 (1995; Zbl 0851.20025)] and \textit{A. Szczepański} and \textit{A. Vesnin}, [J. Knot Theory Ramifications 10, No. 8, 1269-1279 (2001; Zbl 1011.20026)]. The underlying graph is a tadpole graph. The authors show that such a group is the natural HNN extension of a cyclically presented group and they investigate the relationship between the LOG group and the cyclically presented groups. They relate the second homotopy groups of their presentations and they show that hyperbolicity of the cyclically presented group implies solvability of the conjugacy problem for the LOG group. In the case where the label of the tail of the LOG spells a positive word in the vertices in the circuit, they show that the LOGs and groups coincide with those considered by Szczepański and Vesnin in the paper quoted above. They obtain cyclically presented groups and they show that the groups of Fibonacci type introduced by Johnson and Mawdesley are of this form.