Tadpole labelled oriented graph groups and cyclically presented groups.

conjugacy problem cyclically presented groups decision problems Fibonacci groups HNN extensions hyperbolic groups labelled oriented graph groups SQ-universal groups

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Generators, relations, and presentations of groups (20F05) Cancellation theory of groups; application of van Kampen diagrams (20F06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Hyperbolic groups and nonpositively curved groups (20F67) Fundamental group, presentations, free differential calculus (57M05)

Abstract: 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.

Review text

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.

Recommendations

Cites work

Cited in

(18)

Describes a project that uses

Uses Software

GAP

This page was built for publication: Tadpole labelled oriented graph groups and cyclically presented groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1952153)