Date of Submission
Academic Programs and Concentrations
Computer Science; Mathematics
Project Advisor 1
Project Advisor 2
We describe an implementation of the solution to the conjugacy problem in Thompson's group V as presented by James Belk and Francesco Matucci in 2013. Thompson's group V is an infinite finitely presented group whose elements are complete binary prefix replacement maps. From these we can construct closed abstract strand diagrams, which are certain directed graphs with a rotation system and an associated cohomology class. The algorithm checks for conjugacy by constructing and comparing these graphs together with their cohomology classes. We provide a complete outline of our solution algorithm, as well as a description of the data structures which store closed abstract strand diagrams and contain methods to simplify and compare them. The final conjugacy checking program runs in cubic time.
Open Access Agreement
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
Nalecz, Rachel K., "An Implementation of the Solution to the Conjugacy Problem on Thompson's Group V" (2018). Senior Projects Spring 2018. 313.
This work is protected by a Creative Commons license. Any use not permitted under that license is prohibited.