Group isomorphism problem
In abstract algebra, the group isomorphism problem is the decision problem of determining whether two given finite group presentations refer to isomorphic groups.
The isomorphism problem was formulated by Max Dehn,[1] and together with the word problem and conjugacy problem, is one of three fundamental decision problems in group theory he identified in 1911.[2] 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,[3] a consequence of the Adian–Rabin theorem due to Sergei Adian and Michael O. Rabin.
The group isomorphism problem, in which the groups are given by multiplication tables, can be reduced to a graph isomorphism problem but not viceversa[4]. Both have quasi-polynomial-time algorithms, the former since 1978 attributed to Robert Tarjan[5] and the latter since 2015 by László Babai.[6] A little but important improvement for the case p-groups of class 2 was obtained in 2023 by Xiaorui Sun.[7][4]
References
- ↑ Dehn, Max (1911). "Über unendliche diskontinuierliche Gruppenn". Math. Ann. 71: 116–144. doi:10.1007/BF01456932.
- ↑ Magnus, Wilhelm; Karrass, Abraham; Solitar, Donald (1996). Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations (2nd ed.). New York: Dover Publications. pp. 24–29. ISBN 0486632814. https://vdoc.pub/download/combinatorial-group-theory-presentations-of-groups-in-terms-of-generators-and-relations-1hi405kpbp4g. Retrieved 14 October 2022.
- ↑ Miller, Charles F. III (1992). "Decision Problems for Groups—survey and Reflections". Algorithms and Classification in Combinatorial Group Theory. Mathematical Sciences Research Institute Publications. 23. New York: Springer-Verlag. pp. 1–59. doi:10.1007/978-1-4613-9730-4_1. ISBN 9781461397328. https://link.springer.com/chapter/10.1007/978-1-4613-9730-4_1.pdf. (See Corollary 3.4)
- ↑ 4.0 4.1 Hartnett, Kevin (23 June 2023). "Computer Scientists Inch Closer to Major Algorithmic Goal". https://www.quantamagazine.org/computer-scientists-inch-closer-to-major-algorithmic-goal-20230623/.
- ↑ Miller, Gary L. (1978). "On the nlog n isomorphism technique (A Preliminary Report)" (in en). Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78. ACM Press. pp. 51–58. doi:10.1145/800133.804331. ISBN 978-1-4503-7437-8. http://portal.acm.org/citation.cfm?doid=800133.804331.
- ↑ Babai, László (January 9, 2017), Graph isomorphism update, http://people.cs.uchicago.edu/~laci/update.html
- ↑ Sun, Xiaorui (2023). "Faster Isomorphism for p-Groups of Class 2 and Exponent p". arXiv:2303.15412 [cs.DS].
- Johnson, D. L. (1997). Presentations of Groups (2nd ed.). Cambridge: Cambridge University Press. p. 49. doi:10.1017/CBO9781139168410. ISBN 0521372038.
 |  |
