Implementation of a solution to the conjugacy problem in Thompson's group F

Authors:
James Belk;Nabil Hossain;Francesco Matucci;Robert McGrail
Affiliations:
Bard College, Annandale-on-Hudson, NY, USA;Bard College, Annandale-on-Hudson, NY, USA;Université Paris-Sud 11, Bâtiment 425, Bureau 21, F-91405 Orsay Cedex, France;Bard College, Annandale-on-Hudson, NY, USA
Venue:
ACM Communications in Computer Algebra
Year:
2014

Citing 2
Cited 0

Term rewriting and all that

Term rewriting and all that
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an efficient implementation of the solution to the conjugacy problem in Thompson's group F. This algorithm checks for conjugacy by constructing and comparing directed graphs called strand diagrams. We provide a description of our solution algorithm, including the data structure that represents strand diagrams and supports simplifications.