On the conjugacy problem for subdirect products of hyperbolic groups
Abstract
If G1 and G2 are torsion-free hyperbolic groups and P<G1× G2 is a finitely generated subdirect product, then the conjugacy problem in P is solvable if and only if there is a uniform algorithm to decide membership of the cyclic subgroups in the finitely presented group G1/(P G1). The proof of this result relies on a new technique for perturbing elements in a hyperbolic group to ensure that they are not proper powers.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.