Solvable-word-problem preformation conjecture
Solvable-word-problem preformation conjecture
Let be an infinite group with solvable word problem and rank . Say that preforms when is a limit of marked copies of in the space of marked groups.
Solvable-word-problem preformation conjecture. There exists a group , non-isomorphic to , with solvable word problem and rank at most , such that preforms .
The statement is motivated by examples such as the Grigorchuk group preforming a free group. The paper explicitly says that it is believed to hold in general but cannot currently be proved.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Emmanuel Rauzy, “Computable analysis on the space of marked groups”, arXiv:2111.01179 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.