Solvable-word-problem preformation conjecture

From papers

Let GG be an infinite group with solvable word problem and rank kk. Say that GG preforms HH when HH is a limit of marked copies of GG in the space of marked groups.

Solvable-word-problem preformation conjecture. There exists a group HH, non-isomorphic to GG, with solvable word problem and rank at most k+1k+1, such that GG preforms HH.

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

No solutions have been posted yet.