Density of jointly periodic points for surjective one-dimensional cellular automata
Statement
Let be the space of doubly infinite sequences over an alphabet of symbols, and let be a surjective one-dimensional cellular automaton. Let be the shift map, and call a point jointly periodic if it is periodic under both and . A subset of is dense if every finite central word occurring in a point of also occurs in some point of the subset. Density conjecture. For every surjective one-dimensional cellular automaton, the jointly periodic points are dense. This is a known open question, including in higher dimensions. It is known for closing maps and for surjective maps with a point of equicontinuity; computational evidence shows, in particular, that every span- surjective one-dimensional cellular automaton on two symbols has jointly periodic points that are at least -dense.
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.