Bartholdi's conjecture on finitely presented or densely related automaton groups
Statement
Let be a group generated by a finite state automaton. Bartholdi's conjecture. The group 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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.