Conjugacy problem in T-RAAGs
Abstract
Abstract In this paper, we construct an implementable algorithm that 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 RAAGs. We also show that T-RAAGs are biautomatic, providing an alternative solution to the conjugacy problem.
Fields of Study & Subjects
Geometric and Algebraic Topology
Quasicrystal Structures and Properties
Finite Group Theory Research
Publication details
- Journal / source
- Glasgow Mathematical Journal
- Publisher
- Cambridge University Press (CUP)
- Pages
- 1–15
- Publication date
- 24 June 2026
- Language
- EN