Lawton, S;
Louder, L;
McReynolds, DB;
(2017)
Decision problems, complexity, traces, and representations.
Groups, Geometry, and Dynamics
, 11
(1)
pp. 165-188.
10.4171/GGD/393.
Preview |
Text
DecisionsComplexityTraces.08-30-16.pdf - Accepted Version Download (218kB) | Preview |
Abstract
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.
| Type: | Article |
|---|---|
| Title: | Decision problems, complexity, traces, and representations |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.4171/GGD/393 |
| Publisher version: | http://dx.doi.org/10.4171/GGD/393 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| Keywords: | Residually finite, conjugacy separable, character variety, trace equivalence, fully residually free |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences > Dept of Mathematics |
| URI: | https://discovery-pp.ucl.ac.uk/id/eprint/1528603 |
Archive Staff Only
 |
View Item |
