A Branch Group With Unsolvable Conjugacy Problem
International Mathematics Research Notices · 08.04.2026 · 2026 (7)
DOI: 10.1093/imrn/rnag062 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Mathematics Research Notices, online erschienen am 07.04.2026. Verfasst von Alex Bishop und 1 weiteren Autor:innen. Die Arbeit nennt 26 Literaturangaben.
Abstract (Originalsprache)
We prove that every finitely generated residually finite group $G$ can be embedded in a finitely generated branch group $\Gamma $ such that two elements in $G$ are conjugate in $G$ if and only if they are conjugate in $\Gamma $. As an application we construct a finitely generated branch group with solvable word problem and unsolvable conjugacy problem and thereby answer a question of Bartholdi, Grigorchuk, and Šuniḱ.
Zitieren
APA
Bishop, A., & Schesler, E. (2026). A Branch Group With Unsolvable Conjugacy Problem. International Mathematics Research Notices, 2026(7). https://doi.org/10.1093/imrn/rnag062
Vancouver
Bishop A, Schesler E. A Branch Group With Unsolvable Conjugacy Problem. International Mathematics Research Notices. 2026;2026(7). doi:10.1093/imrn/rnag062
BibTeX
@article{Bishop2026,
author = {Bishop, Alex and Schesler, Eduard},
title = {A Branch Group With Unsolvable Conjugacy Problem},
journal = {International Mathematics Research Notices},
year = {2026},
volume = {2026},
number = {7},
doi = {10.1093/imrn/rnag062}
}
EUVIMED