Group isomorphism problem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In abstract algebra, the group isomorphism problem is the decision problem of determining whether two given finite group presentations present isomorphic groups.

The isomorphism problem was identified by Max Dehn in 1911[1] as one of three fundamental decision problems in group theory; the other two being the word problem and the conjugacy problem. All three problems are undecidable: there does not exist a computer algorithm that correctly solves every instance of the isomorphism problem, or of the other two problems, regardless of how much time is allowed for the algorithm to run. In fact the problem of deciding whether a group is trivial is undecidable,[2] a consequence of the Adian–Rabin theorem due to Sergei Adian and Michael O. Rabin.


  1. ^ Dehn 1911.
  2. ^ Miller, Charles (1992). "Decision problems for groups—survey and reflections.". Algorithms and classification in combinatorial group theory. Algorithms and classification in combinatorial group theory (Berkeley, CA, 1989). Corollary 3.4: Springer. pp. 1–59. CiteSeerX{{cite conference}}: CS1 maint: location (link)