Decision problems, complexity, traces, and representations

Abstract

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.

v3: Final version. Shorter with mild improvements of results. To appear in Groups Geom. Dyn

References in corpus (3)

• Dense embeddings of surface groups
• Fundamental Groups of Character Varieties: Surfaces and Tori
• Algorithmically complex residually finite groups

Cited by in corpus (5)

• Effective Separability of Finitely Generated Nilpotent Groups
• Computability of finite quotients of finitely generated groups
• Residual finiteness and strict distortion of cyclic subgroups of solvable groups
• Bounding conjugacy depth functions for wreath products of finitely generated abelian groups
• Conjugacy depth function for generalised lamplighter groups