Conjugacy problem in T-RAAGs
Group Theory
2025-09-25 v1 Combinatorics
Logic
Abstract
In this paper, we construct an implementable algorithm which solves the conjugacy problem in twisted right-angled Artin groups (T-RAAGs). In certain cases, the complexity is known to be linear, by reducing the problem to the twisted conjugacy problem in right-angled Artin groups. We also show that T-RAAGs are biautomatic, providing an alternative solution to the conjugacy problem.
Cite
@article{arxiv.2509.19998,
title = {Conjugacy problem in T-RAAGs},
author = {Gemma Crowe and Islam Foniqi},
journal= {arXiv preprint arXiv:2509.19998},
year = {2025}
}