Gottschalk's surjunctivity conjecture for cellular automata
Statement
Let be a group and a finite alphabet. A cellular automaton is a -equivariant continuous map . Gottschalk's conjecture. If is injective, then it is surjective and hence an isomorphism. This conjecture motivates the notion of a surjunctive group: a group for which the assertion holds for every finite alphabet; it is known for all sofic groups, while the general case remains open.
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.