Decision problems, complexity, traces, and representations
arXiv:1312.1261 · doi:10.4171/GGD/393
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.
arXiv commentv3: Final version. Shorter with mild improvements of results. To appear in Groups Geom. Dyn
References in corpus (12)
- Quantifying Residual Finiteness
- Generators, Relations and Symmetries in Pairs of 3x3 Unimodular Matrices
- Topology of character varieties of Abelian groups
- Singularities of free group character varieties
- Dense embeddings of surface groups
- Separability of double cosets and conjugacy classes in 3-manifold groups
- Quantifying residual finiteness of arithmetic groups
- On the self-intersections of curves deep in the lower central series of a surface group
- Fundamental Groups of Character Varieties: Surfaces and Tori
- Knottedness is in NP, modulo GRH
- Compactifications and algebraic completions of Limit groups
- 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