Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T11:58:46.432Z Has data issue: false hasContentIssue false

On a Group Presentation Due to Fox

Published online by Cambridge University Press:  20 November 2018

C. M. Campbell
Affiliation:
Mathematical Institute, University of St. Andrews, St. Andrews, KY16 9SS, Scotland
E. F. Robertson
Affiliation:
Mathematical Institute, University of St. Andrews, St. Andrews, KY16 9SS, Scotland
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In 1956 R. H. Fox had occasion, while investigating fundamental groups of topological surfaces, to believe that the group <a, b | ab 2=b 3 a, ba 2=a 2 b> was trivial. Using the Todd-Coxeter coset enumeration algorithm a proof was obtained, see [3], and this algorithmic proof was used to produce an algebraic proof, see [2]. In [1] Benson and Mendelsohn, using a similar method to that of [2] showed that <a, b | ab n =b n+1 a, ba n =a n+1 b> is trivial. In this note we give a direct proof for the more general problem of describing the structure of the group <a, b | ab n =b ℓ a, ba n =a ℓ b>.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1976