Groups, Geometry, and Dynamics


Full-Text PDF (296 KB) | Metadata | Table of Contents | GGD summary
Volume 11, Issue 1, 2017, pp. 165–188
DOI: 10.4171/GGD/393

Published online: 2017-04-20

Decision problems, complexity, traces, and representations

Sean Lawton[1], Larsen Louder[2] and D.B. McReynolds[3]

(1) George Mason University, Fairfax, USA
(2) University College London, UK
(3) Purdue University, West Lafayette, USA

In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on finitely generated groups. The main focus is on the conjugacy problem in conjugacy separable groups, where we measure efficiency in terms of the size of the quotients required to distinguish a distinct pair of conjugacy classes.

Keywords: Residually finite, conjugacy separable, character variety, trace equivalence, fully residually free

Lawton Sean, Louder Larsen, McReynolds D.B.: Decision problems, complexity, traces, and representations. Groups Geom. Dyn. 11 (2017), 165-188. doi: 10.4171/GGD/393