Nathan Barker, Andrew Duncan and David Robertson are currently preparing a paper entitled The power conjugacy problem in Higman-Thompson groups which describes an algorithm to solve a certain equation in the groups named
This package aims to implement the algorithms described in the paper. To do so it provides tools for working in
- the algebra
$V_{n,r}$ , a certain set of words, and - the automorphism group
$G_{n,r} = \Aut V_{n,r}$ .
Either clone the repository with
git clone https://github.com/DMRobertson/thompsons_v.git
or download the ZIPped version and extract it. For more detailed instructions, see the documentation.
Documentation is automatically built by Read the Docs. For a brief introduction see [the demo notebook](Thompson example.ipynb).
The HTML documentation is generated using Sphinx. To build, ensure that Sphinx is installed (pip install sphinx
), then navigate to the docs folder and run make html
. More interestingly, I'm using Sphinx's doctest extension to run some simple automated tests. To use it, ensure Sphinx is installed and run make doctest
from the docs directory.