The power conjugacy problem in Higman-Thompson groups
Group Theory
2015-12-29 v2
Abstract
An introduction to the universal algebra approach to Higman-Thompson groups (including Thompson's group ) is given, following a series of lectures by Graham Higman in 1973. In these talks, Higman outlined an algorithm for the conjugacy problem; which although essentially correct fails in certain cases, as we show here. A revised and complete version of the algorithm is written out explicitly. From this, we construct an algorithm for the power conjugacy problem in these groups. Python implementations of these algorithms can be found at [26].
Keywords
Cite
@article{arxiv.1503.01032,
title = {The power conjugacy problem in Higman-Thompson groups},
author = {Nathan Barker and Andrew J. Duncan and David M. Robertson},
journal= {arXiv preprint arXiv:1503.01032},
year = {2015}
}
Comments
58 pages, improved introduction, added pond-orbit illustration and some phrasing improved throughout the paper