For a finite group G we define the graph Γ(G) to be the graph whose vertices are the conjugacy classes of cyclic subgroups of G and two conjugacy classes A, B are joined by an edge if for some A ∈ A, B ∈ B A and B permute. We characterise those groups G for which

We construct a hyperbolic group containing a finitely presented subgroup, which has infinitely many conjugacy classes of finite-order elements. We also use a version of Morse theory with high dimensional horizontal cells and use handle cancellation arguments to produce other examples of subgroups of CAT(0) groups with infinitely many conjugacy classes of finite-order elements.

S. Gersten announced an algorithm that takes as input two finite sequences K →=(K 1 ,⋯,K N ) and ′ of conjugacy classes finitely generated subgroups F n outputs:

We prove that finite index subgroups of right angled Artin groups are conjugacy separable. We then apply this result to establish various properties of other classes of groups. In particular, we show that any word hyperbolic Coxeter group contains a conjugacy separable subgroup of finite index and has a residually finite outer automorphism group. Another consequence of the main result is that B...

We construct a CAT(0) group containing a finitely presented subgroup with infinitely many conjugacy classes of finiteorder elements. Unlike previous examples (which were based on right-angled Artin groups) our ambient CAT(0) group does not contain any rank 3 free abelian subgroups. We also construct examples of groups of type Fn inside mapping class groups, Aut(Fk), and Out(Fk) which have infin...