Year: 2023
Type: preprint
Abstract: In 2009, Crisp, Godelle and Wiest constructed a linear-time algorithm to solve the conjugacy problem in right-angled Artin groups. This algorithm has now been implemented in Python, and the code is freely available on GitHub. This document provides a summary of how the code works. As well as determining whether two elements $w_{1}, w_{2}$ are conjugate in a RAAG $A_Γ$, our code also returns a conjugating element $x \in A_Γ$ such that $w_{1} = x^{-1}w_{2}x$, if $w_{1}$ and $w_{2}$ are conjugate.
Source: arXiv (Cornell University)
Authors: Crowe, Gemma, Jones, Michael
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funder: Heriot-Watt University
OpenAlex ID: W4376312116