Decision problems, complexity, traces, and representations

@article{Lawton2017DecisionPC,
  title={Decision problems, complexity, traces, and representations},
  author={S. Lawton and L. Louder and D. B. McReynolds},
  journal={Groups, Geometry, and Dynamics},
  year={2017},
  volume={11},
  pages={165-188}
}
In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on infinitely 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. 

References

SHOWING 1-10 OF 50 REFERENCES
Uniform independence in linear groups
Asymptotic growth and least common multiples in groups
Bertrand's postulate and subgroup growth
Singularities of free group character varieties
Bounding the residual finiteness of free groups
Quantifying residual finiteness
The Topology of Algebraic Quotients
...
1
2
3
4
5
...