Dice Question Streamline Icon: https://streamlinehq.com

General conjugacy problem for one-relator groups

Determine whether the conjugacy problem is decidable for all one-relator groups given by a finite presentation with a single defining relator.

Information Square Streamline Icon: https://streamlinehq.com

Background

Dehn posed the conjugacy problem as one of the three fundamental decision problems for finitely presented groups. Magnus solved the word problem for all one-relator groups, but the status of the conjugacy problem has remained unresolved in full generality despite many partial results (e.g., for hyperbolic, torsion, cyclically pinched, and some other subclasses).

References

Finally, in \S(1980) we go further in-depth on some decision problems for one-relator groups, including the conjugacy problem, the isomorphism problem (both of which remain open in general), and the complexity of the word problem.

The theory of one-relator groups: history and recent progress (2501.18306 - Linton et al., 30 Jan 2025) in Section 8, Decision problems (1960–1980)