Density of jointly periodic points for surjective one-dimensional cellular automata
Density of jointly periodic points for surjective one-dimensional cellular automata
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.
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
Mike Boyle and Bryant Lee, “Jointly periodic points in cellular automata: computer explorations and conjectures”, arXiv:math/0607178 (2006).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.