Implementation: The conjugacy problem in right-angled Artin groups

arXiv2305.06636MaRDI QIDQ6436216FDOQ6436216

Authors: Gemma Crowe, Mike Swarbrick Jones 

Publication date: 11 May 2023

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_{Gamma}$, our code also returns a conjugating element $xin{A}_{Gamma}$ such that $w_1=x^{-1}{w}_{2}x$, if $w_1$ and $w_2$ are conjugate.

Has companion code repository: https://github.com/gmc369/conjugacy-problem-raags

Mathematics Subject Classification ID

Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Computational methods for problems pertaining to group theory (20-08)

This page was built for publication: Implementation: The conjugacy problem in right-angled Artin groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6436216)