Bartholdi's conjecture on finitely presented or densely related automaton groups

Let GG be a group generated by a finite state automaton. Bartholdi's conjecture. The group GG is either finitely presented or densely related. This conjecture concerns the relation range of groups generated by finite-state automata. The paper presents the Grigorchuk group as an example of a densely related group, but gives no resolution of the conjecture for all such groups.

Sources & referencesView supporting material

Primary source

Yves Cornulier and Adrien Le Boudec, “Densely related groups”, arXiv:1610.09469 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.